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

DOI10.1016/J.COMGEO.2006.11.003zbMATH Open1114.65308DBLPjournals/comgeo/BandyopadhyayS07OpenAlexW2013421211WikidataQ56970398 ScholiaQ56970398MaRDI QIDQ2371333FDOQ2371333

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

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

zbMATH Keywords

robusttessellationnearest neighborprotein structureDelaunay triangulationimprecision3Dalmost-Delaunay simplicescomputational geometry algorithms library (CGAL)

Mathematics Subject Classification ID

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

Cites Work

• The quickhull algorithm for convex hulls
• Triangulations in CGAL
• Title not available (Why is that?)
• Almost-Delaunay simplices, nearest neighbor relations for imprecise points

Cited In (4)

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

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)