URL
Lecture #4 [Patrignani 2001] On the complexity of orthogonal compaction
Lecture #3: reference for the NP-hardness proof regarding optimally "compactifying" an orthogonal drawing of an embedded graph.
Click http://www.sciencedirect.com/science/article/pii/S0925772101000104 link to open resource.