Iterated snap rounding

Computational Geometry: Theory and Applications

Volumn 23, Issue 2, 2002, Pages 209-225

  Halperin, Dan ^a   Packer, Eli ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Arrangements; Geometric rounding; Robustness

Indexed keywords

EID: 31244431734     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00064-5     Document Type: Article

References (18)

1. P.K. Agarwal, M. Sharir, Applications of a new space-partitioning technique, Discrete Comput. Geom. 9 (1993) 11-38.
2. I.J. Balaban, An optimal algorithm for finding segment intersections, in: Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 211-219.
3. J. Canny, B.R. Donald, E.K. Ressler, A rational rotation method for robust geometric algorithms, in: Proc. 8th Annu. ACM Sympos. Comput. Geom., 1992, pp. 251-260.
4. B. Chazelle, H.'Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. ACM 39 (1) (1992) 1-54.
5. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, M. van Kreveld, Efficient ray shooting and hidden surface removal, Algorithmica 12 (1994) 30-53.
6. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, Heidelberg, 1997.
7. S. Fortune, Vertex-rounding a three-dimensional polyhedral subdivision, Discrete Comput. Geom. 22 (4) (1999) 593-618.
8. M. Goodrich, L.J. Guibas, J. Hershberger, P. Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 284-293.
9. D.H. Greene, Integer line segment intersection, Unpublished manuscript.
10. D.H. Greene, F.F. Yao, Finite-resolution computational geometry, in: Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., 1986, pp. 143-152.
11. L. Guibas, D. Marimont, Rounding arrangements dynamically, Internat. J. Comput. Geom. Appl. 8 (1998) 157-176.
12. J.D. Hobby, Practical segment intersection with finite precision output, Computational Geometry 13 (1999) 199-214.
13. V.J. Milenkovic, Rounding face lattices in d dimensions, in: Proc. 2nd Canad. Conf. Comput. Geom., 1990, pp. 40-45.
14. V.J. Milenkovic, Rotational polygon containment and minimum enclosure using only robust 2D constructions, Computational Geometry 13 (1) (1999) 3-19.
15. V.J. Milenkovic, Shortest path geometric rounding, Algorithmica 27 (1) (2000) 57-86.
16. S. Raab, Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes, M.Sc. Thesis, Dept. Comput. Sci., Bar llan University, Ramat Gan, Israel, 1999, http://www.math.tau. ac.il/˜raab/master_thesis.ps.
17. S. Schirra, Robustness and precision issues in geometric computation, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier Science, North-Holland, Amsterdam, 1999, pp. 597-632.
18. C.K. Yap, Robust geometric computation, in: J.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, Chapter 35, CRC Press LLC, Boca Raton, FL, 1997, pp. 653-668.