Lower bounds for planar orthogonal drawings of graphs

DOI10.1016/0020-0190(91)90059-QzbMath0735.68090WikidataQ126298024 ScholiaQ126298024MaRDI QIDQ1182115

Roberto Tamassia, Jeffrey Scott Vitter, Ioannis. G. Tollis

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

planar embeddingVLSI layoutbendsorthogonal drawings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

An efficient parallel algorithm for finding rectangular duals of plane triangular graphs, Drawing planar graphs using the canonical ordering, Algorithms for area-efficient orthogonal drawing, A better heuristic for orthogonal graph drawings, Planar Confluent Orthogonal Drawings of 4-Modal Digraphs, Planar confluent orthogonal drawings of 4-modal digraphs, A topology-shape-metrics framework for ortho-radial graph drawing, Schnyder decompositions for regular plane graphs and application to drawing, Bend-optimal orthogonal drawings of triconnected plane graphs, Bend-minimum orthogonal drawings in quadratic time, -shaped point set embeddings of high-degree plane graphs, On embedding a graph in the grid with the maximum number of bends and other bad features, Efficient Algorithms for Ortho-Radial Graph Drawing., Advances in the theory and practice of graph drawing

Cites Work

• Unnamed Item
• Algorithms for drawing graphs: An annotated bibliography
• On minimal-node-cost planar embeddings
• Amortized Computational Complexity
• On Embedding a Graph in the Grid with the Minimum Number of Bends