Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation
Authors:
- Changhee LeeCLChanghee Lee
- Donguk KimDKDonguk Kim
- Hayong ShinHSHayong Shin
- Deok-Soo KimDKDeok-Soo Kim
- 1 August 2008
- journal article
- Published by Elsevier in Computer-Aided Design
- Vol. 40 (8) , 852-862
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Quasi-triangulation and interworld data structure in three dimensionsComputer-Aided Design, 2006
- Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimationComputer-Aided Design, 2006
- On the normal vector estimation for point cloud data from smooth surfacesComputer-Aided Design, 2005
- A survey of point-based techniques in computer graphicsComputers & Graphics, 2004
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. GeometryComputer Aided Geometric Design, 2001
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. TopologyComputer Aided Geometric Design, 2001
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- Relative neighborhood graphs and their relativesProceedings of the IEEE, 1992
- Surface reconstruction from unorganized pointsACM SIGGRAPH Computer Graphics, 1992
- Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the PlaneGeographical Analysis, 1980