Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation
A General Approach to Removing Degeneracies
SIAM Journal on Computing
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Efficient exact geometric computation made easy
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
An epsilon-Arithmetic for Removing Degeneracies
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
| Hi-index | 0.00 |
Most geometric algorithms are formulated under the nondegeneracy assumption which usually does not hold in practice. When implementing such an algorithm, a treatment of degenerate cases is necessary to prevent incorrect outputs or crashes. One way to overcome this nontrivial task is to use perturbations. In this paper we describe a generic implementation of efficient random linear perturbations within Cgal and discuss the practicality of using it examining the convex hull problem, line segment intersection and Delaunay triangulation.