A more compact visibility representation

DOI10.1007/3-540-57899-4_70zbMath1528.68303OpenAlexW1488285714MaRDI QIDQ6143992

Goos Kant

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17064

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Constrained visibility representations of graphs
• Area requirement and symmetry display of planar upward drawings
• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• Algorithms for drawing graphs: An annotated bibliography
• Arboricity and Subgraph Listing Algorithms
• Finding short cycles in planar graphs using separators
• Dividing a Graph into Triconnected Components
• How to draw a series-parallel digraph
• The Two-Triangle Case of the Acquaintance Graph

This page was built for publication: A more compact visibility representation