Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL

DOI10.1016/J.COMGEO.2006.11.003MaRDI QIDQ2371333zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Deepak Bandyopadhyay, Jack Snoeyink

Publication date 4 July 2007

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2006.11.003

zbMATH Keywords

3Dalmost-Delaunay simplicescomputational geometry algorithms library (CGAL)Delaunay triangulationimprecisionnearest neighborprotein structurerobusttessellation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packaged methods for numerical algorithms (65Y15)

Recommendations

• Almost-Delaunay simplices, nearest neighbor relations for imprecise points
• CGAL -- reliable geometric computing for academia and industry
• Decoupling the \textsc{Cgal} 3D triangulations from the underlying space
• scientific article; zbMATH DE number 2079354
• scientific article; zbMATH DE number 5019916

Cites work

• Almost-Delaunay simplices, nearest neighbor relations for imprecise points
• scientific article; zbMATH DE number 1848394 (Why is no real title available?)
• The quickhull algorithm for convex hulls
• Triangulations in CGAL

Cited in

(4)

• Delaunay triangulation of imprecise points in linear time after preprocessing
• Almost-Delaunay simplices, nearest neighbor relations for imprecise points
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Triangulating input-constrained planar point sets

Describes a project that uses

Uses Software

• CGAL
• Matlab
• Qhull
• 2D triangulations
• STL

This page was built for publication: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL

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