Iterated snap rounding

[1]  F. Frances Yao,et al.  Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Bruce Randall Donald,et al.  A rational rotation method for robust geometric algorithms , 1991, SCG '92.

[3]  An optimal algorithm for intersecting line segments in the plane , 1992, JACM.

[4]  Franklin P. Antonio.  Faster Line Segment Intersection , 1992, Graphics Gems III.

[5]  Micha Sharir,et al.  Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..

[6]  Ivan J. Balaban,et al.  An optimal algorithm for finding segments intersections , 1995, SCG '95.

[7]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[8]  Leonidas J. Guibas,et al.  Snap rounding line segments efficiently in two and three dimensions , 1997, SCG '97.

[9]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[10]  Leonidas J. Guibas,et al.  Rounding Arrangements Dynamically , 1998, Int. J. Comput. Geom. Appl..

[11]  John D. Hobby,et al.  Practical segment intersection with finite precision output , 1999, Comput. Geom..

[12]  Sigal Raab,et al.  Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes , 1999, SCG '99.

[13]  Victor J. Milenkovic,et al.  Rotational polygon containment and minimum enclosure using only robust 2D constructions , 1999, Comput. Geom..

[14]  Steven Fortune.  Vertex-Rounding a Three-Dimensional Polyhedral Subdivision , 1999, Discret. Comput. Geom..

[15]  Victor J. Milenkovic.  Shortest Path Geometric Rounding , 2000, Algorithmica.

[16]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[17]  Stefan Schirra,et al.  Robustness and Precision Issues in Geometric Computation , 2000, Handbook of Computational Geometry.

[18]  Chee-Keng Yap,et al.  Robust Geometric Computation , 2016, Encyclopedia of Algorithms.