Scalable, Versatile and Simple Constrained Graph Layout
| dc.contributor.author | Dwyer, Tim | en_US |
| dc.contributor.editor | H.-C. Hege, I. Hotz, and T. Munzner | en_US |
| dc.date.accessioned | 2014-02-21T19:50:58Z | |
| dc.date.available | 2014-02-21T19:50:58Z | |
| dc.date.issued | 2009 | en_US |
| dc.description.abstract | We 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.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 28 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2009.01449.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Scalable, Versatile and Simple Constrained Graph Layout | en_US |