Efficient algorithms for line and curve segment intersection using restricted predicates

Improved construction of vertical decompositions of three-dimensional arrangements

Proceedings of the eighteenth annual symposium on Computational geometry

Reporting intersections among thick objects

Information Processing Letters

Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Optimal and suboptimal robust algorithms for proximity graphs

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01

Moving coins

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004

Line-segment intersection made in-place

Computational Geometry: Theory and Applications

Moving coins

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004

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

Computational geometry II

Algorithms and theory of computation handbook