Almost-Delaunay simplices, nearest neighbor relations for imprecise points
From MaRDI portal
Publication:5501287
zbMATH Open1317.68244MaRDI QIDQ5501287FDOQ5501287
Authors: Deepak Bandyopadhyay, Jack Snoeyink 
Publication date: 3 August 2015
Recommendations
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- scientific article; zbMATH DE number 5019916
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- scientific article; zbMATH DE number 1240687
- Application of Voronoï polyhedrons and Delaunay simplexes to analysis of structure of three-dimensional models of disordered systems.
Biochemistry, molecular biology (92C40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (11)
- Largest and smallest convex hulls for imprecise points
- Approximating Largest Convex Hulls for Imprecise Points
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- Toward the fast blind docking of a peptide to a target protein by using a four-body statistical pseudo-potential
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Algorithm 1012
- Approximating largest convex hulls for imprecise points
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
This page was built for publication: Almost-Delaunay simplices, nearest neighbor relations for imprecise points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501287)
