Voronoi diagrams and arrangements
Discrete & Computational Geometry
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Realizability of Delaunay triangulations
Information Processing Letters
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Look — a Lazy Object-Oriented Kernel for geometric computation
Proceedings of the sixteenth annual symposium on Computational geometry
Detecting undersampling in surface reconstruction
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Quality meshing with weighted Delaunay refinement
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
An empirical comparison of techniques for updating Delaunay triangulations
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
Computational Geometry: Theory and Applications
Sliver-free perturbation for the Delaunay tetrahedrization
Computer-Aided Design
A streaming algorithm for surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Point-cloud simplification with bounded geometric deviations
International Journal of Computer Applications in Technology
Modelling three-dimensional geoscientific fields with the Voronoi diagram and its dual
International Journal of Geographical Information Science
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
Computational Geometry: Theory and Applications
Exact geometric and algebraic computations in CGAL
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry: Theory and Applications
Hybrid algorithm for deletion of a point in regular and Delaunay triangulation
Proceedings of the 25th Spring Conference on Computer Graphics
Delaunay triangulations of point sets in closed euclidean d-manifolds
Proceedings of the twenty-seventh annual symposium on Computational geometry
Flipping to robustly delete a vertex in a delaunay tetrahedralization
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
High quality real-time image-to-mesh conversion for finite element simulations
Proceedings of the 27th international ACM conference on International conference on supercomputing
High quality real-time Image-to-Mesh conversion for finite element simulations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in practice.We propose a simple method that allows to remove any vertex even when the points are in very degenerate configurations. The solution is available in CGAL.