Numerical stability of algorithms for line arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Randomized algorithms
Exact geometric predicates using cascaded computation
Proceedings of the fourteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Introduction to Algorithms
One Sided Error Predicates in Geometric Computing
IFIP World Computer Congress on Fundamentals - Foundations of Computer Science
Verifiable implementations of geometric algorithms using finite precision arithmetic
Verifiable implementations of geometric algorithms using finite precision arithmetic
Hi-index | 0.00 |
We introduce a new and simple filtering technique that can be used in the implementation of geometric algorithms called ''structural filtering''. Using this filtering technique we gain about 20% when compared to predicate-filtered implementations. Of theoretical interest are some results regarding the robustness of sorting algorithms against erroneous comparisons. There is software support for the concept of structural filtering in LEDA (Library of Efficient Data Types and Algorithms, http://www.mpi-sb.mpg.de/LEDA/leda.html) and CGAL (Computational Geometry Algorithms Library, http://www.cgal.org).