Verifiable implementations of geometric algorithms using finite precision arithmetic

Sweeping arrangements of curves

SCG '89 Proceedings of the fifth annual symposium on Computational geometry

Constructing strongly convex hulls using exact or rounded arithmetic

SCG '90 Proceedings of the sixth annual symposium on Computational geometry

Numerical stability of algorithms for line arrangements

SCG '91 Proceedings of the seventh annual symposium on Computational geometry

Numerical stability of algorithms for 2D Delaunay triangulations

SCG '92 Proceedings of the eighth annual symposium on Computational geometry

Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation

SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications

Computational geometry: a retrospective

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Rounding arrangements dynamically

Proceedings of the eleventh annual symposium on Computational geometry

On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

Proceedings of the twelfth annual symposium on Computational geometry

Lazy Arithmetic

IEEE Transactions on Computers

Approximate data structures with applications

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

From Algorithm to Program to Software Library

Informatics - 10 Years Back. 10 Years Ahead.

Structural filtering: a paradigm for efficient and exact geometric programs

Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99

Structural filtering: a paradigm for efficient and exact geometric programs

Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99