Verifiable implementation of geometric algorithms using finite precision arithmetic
Artificial Intelligence - Special issue on geometric reasoning
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Verifiable implementations of geometric algorithms using finite precision arithmetic
Verifiable implementations of geometric algorithms using finite precision arithmetic
Numerical Methods
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polyhedral modelling with exact arithmetic
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Efficient exact evaluation of signs of determinants
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing exact geometric predicates using modular arithmetic with single precision
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Applications of the Generic Programming Paradigm in the Design of CGAL
Selected Papers from the International Seminar on Generic Programming
Delete and insert operations in Voronoi/Delaunay methods and applications
Computers & Geosciences
TetSplat Real-Time Rendering and Volume Clipping of Large Unstructured Tetrahedral Meshes
VIS '04 Proceedings of the conference on Visualization '04
Face aging by sparse representation
PCM'10 Proceedings of the Advances in multimedia information processing, and 11th Pacific Rim conference on Multimedia: Part II
The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
Proceedings of the twenty-seventh annual symposium on Computational geometry
Colorization for gray scale facial image by locality-constrained linear coding
PCM'12 Proceedings of the 13th Pacific-Rim conference on Advances in Multimedia Information Processing
| Hi-index | 0.00 |
We show that two Delaunay triangulation algorithms, a diagonal-flipping algorithm and an incremental algorithm, can be implemented in approxiamte arithmetic. The two algorithms have worst-case running time O(n2) on a set of n sites. The correctness assertion is that the algorithms produce a triangulation of the set of sites so that each triangle has an “almost empty” circumcircle, i.e., a circumscribing pseudocircle slightly contracted from the circumcircle contains no sites in its interior.