Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks

DOI10.20382/JOCG.V11I1A13MaRDI QIDQ5120158zbMATH OpenOpenAlexFDO

Authors Balázs Keszegh, Dömötör Pálvölgyi

Publication date 9 September 2020

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

Mathematics Subject Classification ID

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

Abstract: We study general Delaunay-graphs, which are natural generalizations of Delaunay triangulations to arbitrary families, in particular to pseudo-disks. We prove that for any finite pseudo-disk family and point set, there is a plane drawing of their Delaunay-graph such that every edge lies inside every pseudo-disk that contains its endpoints.

Recommendations

• Generalized Delaunay triangulation for planar graphs
• Constrained generalized Delaunay graphs are plane spanners
• Aligned drawings of planar graphs
• An upper bound for conforming Delaunay triangulations
• Aligned drawings of planar graphs

Cited in

(2)

• Coloring Delaunay-edges and their generalizations
• Obedient plane drawings for disk intersection graphs

This page was built for publication: Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120158)