Arrangements of orthogonal circles with many intersections

DOI10.1007/978-3-030-92931-2_24OpenAlexW3170024904MaRDI QIDQ2151458

Sarah Carmesin, André Schulz

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2106.03557

zbMATH Keywords

planar graphsintersection graphsorthogonal intersectioncircle arrangements

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
• Drawing graphs with right angle crossings
• Arrangements of pseudocircles and circles
• Unit disk graph recognition is NP-hard
• On arrangements of orthogonal circles
• The number of disk graphs
• Lombardi Drawings of Graphs
• Arrangements of pseudocircles: on circularizability
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• On the complexity of arrangements of circles in the plane

This page was built for publication: Arrangements of orthogonal circles with many intersections