Abstract
There are several scenarios in which a given drawing of a graph is to be modified subject to preservation constraints. Examples include shape simplification, sketch-based, and dynamic graph layout. While the orthogonal ordering of vertices is a natural and frequently called for preservation constraint, we show that, unfortunately, it results in severe algorithmic difficulties even for the simplest graphs. More precisely, we show that orthogonal-order preserving rectilinear and uniform edge length drawing is -hard even for paths. © 2009 Springer Berlin Heidelberg.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Brandes, U., & Pampel, B. (2009). On the hardness of orthogonal-order preserving graph drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 266–277). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_25
Readers over time
Readers' Seniority
Readers' Discipline
