Proportional Contact Representations of Planar Graphs
DOI10.1007/978-3-642-25878-7_4zbMath1311.68096OpenAlexW1968739134MaRDI QIDQ5895512
Michael Kaufmann, Stefan Felsner, Md. Jawaherul Alam, Stephen G. Kobourov, Therese C. Biedl
Publication date: 9 March 2012
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_4
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 representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Cites Work
- Unnamed Item
- How to draw a planar graph on a grid
- On rectangular cartograms
- On grid intersection graphs
- Optimal polygonal representation of planar graphs
- Pebble game algorithms and sparse graphs
- On Touching Triangle Graphs
- Triangle Contact Representations and Duality
- Rectangular duals of planar graphs
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- On Triangle Contact Graphs
- Rectangular layouts and contact graphs
- Contact representations of planar graphs with cubes
- On Diagrams Representing Maps
- Computing cartograms with optimal complexity
- Proportional Contact Representations of Planar Graphs
- Contact graphs of line segments are NP-complete
This page was built for publication: Proportional Contact Representations of Planar Graphs