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
IWANN
2009
Springer
13 years 11 months ago
On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures
The examination of straightforwardly definable discrete structures in nucleic acids and proteins turned out to be perhaps the most important development in our present knowledge a...
Rafael Ördög, Vince Grolmusz