Exact geometric computation in LEDA

Robust proximity queries: an illustration of degree-driven algorithm design

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry

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

Classical computational geometry in GeomNet

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry

Computing the minimum diameter for moving points: an exact implementation using parametric search

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry

Interval arithmetic yields efficient dynamic filters for computational geometry

Proceedings of the fourteenth annual symposium on Computational geometry

Efficient exact geometric computation made easy

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry

A core library for robust numeric and geometric computation

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry

Efficient algorithms for line and curve segment intersection using restricted predicates

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry

Certified computation of the sign of a matrix determinant

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

A new constructive root bound for algebraic expressions

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

GeomNet: Geometric Computing over the Internet

IEEE Internet Computing

A Case Study on the Cost of Geometric Computing

ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation

Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design

Computing the Implicit Voronoi Diagram in Triple Precision

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design

Proceedings of the twenty-sixth annual symposium on Computational geometry