Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation

DOI10.1016/J.CAD.2008.05.002MaRDI QIDQ628202zbMATH OpenOpenAlexFDO

Authors Changhee Lee, D. Kim, Hayong Shin, D.-S. Kim

Publication date 4 March 2011

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cad.2008.05.002

zbMATH Keywords

Delaunay triangulationVoronoi diagramneighborhood graphelliptic Gabriel graphsearch space reduction

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Efficient Computation of Elliptic Gabriel Graph
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
• Empty-ellipse graphs
• scientific article; zbMATH DE number 1830717
• scientific article; zbMATH DE number 4115994

Cited in

(1)

• Efficient Computation of Elliptic Gabriel Graph

This page was built for publication: Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation

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