Practical level planarity testing and layout with embedding constraints
M Harrigan, P Healy - Graph Drawing: 15th International Symposium, GD …, 2008 - Springer
Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008•Springer
… We describe a practical method to test a leveled graph for level planarity and provide a
level planar layout of the graph if the test succeeds, all in quadratic running-time.
Embedding constraints restricting the order of incident edges around the vertices are
allowed. … We also handle a family of embedding constraints [3] that restrict the order of
incident edges around the vertices. …
level planar layout of the graph if the test succeeds, all in quadratic running-time.
Embedding constraints restricting the order of incident edges around the vertices are
allowed. … We also handle a family of embedding constraints [3] that restrict the order of
incident edges around the vertices. …
Abstract
We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.
Springer
Showing the best result for this search. See all results