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.
أنقر Lecture #4 [Patrignani 2001] On the complexity of orthogonal compaction لفتح المورد.