Empty-ellipse graphs

MaRDI QIDQ3579508zbMATH OpenFDO

Authors Olivier Devillers, Jeff Erickson, Xavier Goaoc

Publication date 6 August 2010

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Delaunay graphs are almost as good as complete graphs
• Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
• Complexity of the Delaunay triangulation of points on polyhedral surfaces
• Nice point sets can have nasty Delaunay triangulations
• Empty region graphs

Cited in

(3)

• Empty triangles in drawings of the complete graph
• Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation
• Empty region graphs

This page was built for publication: Empty-ellipse graphs

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