Lecture #5 [Patrignani 2001] On the complexity of orthogonal compaction
Aggregazione dei criteri
Lecture #3: reference for the NP-hardness proof regarding optimally "compactifying" an orthogonal drawing of an embedded graph.
Per aprire la risorsa fai click su Lecture #5 [Patrignani 2001] On the complexity of orthogonal compaction