Sciweavers

SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 6 months ago
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
Deepak Bandyopadhyay, Jack Snoeyink