Lecture #4 [Patrignani 2001] On the complexity of orthogonal compaction
Completion requirements
Lecture #3: reference for the NP-hardness proof regarding optimally "compactifying" an orthogonal drawing of an embedded graph.
Click on Lecture #4 [Patrignani 2001] On the complexity of orthogonal compaction to open the resource.