Contact Graphs of Circular Arcs

DOI10.1007/978-3-319-21840-3_1zbMath1444.68131OpenAlexW1642013906MaRDI QIDQ3449800

David Eppstein, Md. Jawaherul Alam, Torsten Ueckerdt, Stephen G. Kobourov, Michael Kaufmann, André Schulz, Sergey Pupyrev

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Contact Graphs of Circular Arcs ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ Unnamed Item ⋮ Topological inductive constructions for tight surface graphs

Cites Work

• Unnamed Item
• Triangle contact representations and duality
• A bijection for triangulations, quadrangulations, pentagulations, etc.
• Representations by contact and intersection of segments
• Barycentric systems and stretchability
• Classes and recognition of curve contact graphs
• Planar minimally rigid graphs and pseudo-triangulations
• Optimal polygonal representation of planar graphs
• Pebble game algorithms and sparse graphs
• Area-Universal and Constrained Rectangular Layouts
• Balanced Circle Packings for Planar Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Contact Graphs of Circular Arcs
• Minimum-weight triangulation is NP-hard
• Triangle-Free Planar Graphs and Segment Intersection Graphs
• Algorithms – ESA 2004
• An Inductive Construction of (2,1)-tight Graphs
• Drawing Graphs with Few Arcs
• Proportional Contact Representations of Planar Graphs
• On topological aspects of orientations