Orthogonal-Ordering Constraints are Tough
Ulrik Brandes, Barbara Pampel · Journal of Graph Algorithms and Applications · 2012
We show that rectilinear graph drawing, the core problem of bend-minimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal-ordering constraints.