We present new linear time algorithms using the SPQR-tree data structure for computing planar embeddings of planar graphs optimizing certain distance measures. Experience with orthogonal drawings generated by the topology-shape-metrics approach shows that planar embeddings following these distance measures lead to improved quality of the final drawing in terms of bends, edge length, and drawing area. Given a planar graph, the algorithms compute the planar embedding with 1. the minimum depth among the set of all planar embeddings of G, 2. the external face of maximum size among the set of all planar embeddings of G, 3. the external face of maximum size among the set of all embeddings of G with minimum depth. © Springer-Verlag 2004.
CITATION STYLE
Gutwenger, C., & Mutzel, P. (2004). Graph Embedding with Minimum Depth and Maximum External Face. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 259–272. https://doi.org/10.1007/978-3-540-24595-7_24
Mendeley helps you to discover research relevant for your work.