Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Hi-index | 0.00 |
This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the triangulation can be generated by extending Lawson's edge-swapping algorithm and that point deletion is a local procedure. The rule can be implemented exactly when the points have integer coordinates and can be used to improve image compression methods.