Scalable, Versatile and Simple Constrained Graph Layout

Simple item page
dc.contributor.authorDwyer, Timen_US
dc.contributor.editorH.-C. Hege, I. Hotz, and T. Munzneren_US
dc.date.accessioned2014-02-21T19:50:58Z
dc.date.available2014-02-21T19:50:58Z
dc.date.issued2009en_US
dc.description.abstractWe describe a new technique for graph layout subject to constraints. Compared to previous techniques the proposed method is much faster and scalable to much larger graphs. For a graph with n nodes, m edges and c constraints it computes incremental layout in time O(nlogn+m+c) per iteration. Also, it supports a much more powerful class of constraint: inequalities or equalities over the Euclidean distance between nodes.We demonstrate the power of this technique by application to a number of diagramming conventions which previous constrained graph layout methods could not support. Further, the constraint-satisfaction method inspired by recent work in position-based dynamics is far simpler to implement than previous methods.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01449.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01449.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleScalable, Versatile and Simple Constrained Graph Layouten_US
Files
Collections
28-Issue 3
EuroVis09: Eurographics/ IEEE Symposium on Visualization