Practical segment intersection with finite precision output

Computational Geometry: Theory and Applications

Volumn 13, Issue 4, 1999, Pages 199-214

  Hobby, John D ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Data compression; Degeneracy; Line segment intersection; Snap rounding

Indexed keywords

EID: 0012075052     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00021-8     Document Type: Article

References (32)

1. P.K. Agarwal, M. Sharir, Red-blue intersection detection algorithms with applications to motion planning and collision detection, SIAM J. Comput. 19 (2) (1990) 297-321.
2. J.L. Bentley, T.A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. 28 (9) (1979) 643-647.
3. K.Q. Brown, Comments on 'algorithms for reporting and counting geometric intersections', IEEE Trans. Comput. 30 (2) (1981) 147-148.
4. B. Chazelle, H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Journal of the ACM 39 (1) (1992) 1-54.
5. K.-W. Chiang, S. Nahar, C.-Y. Lo, Time-efficient VLSI artwork analysis algorithms in GOALIE2, IEEE Trans. Comput.-Aided Design Integrated Circuits 8 (6) (1989) 640-648.
6. K.L. Clarkson, Applications of random sampling in computational geometry, II, in: Proceedings of the 4th Annual ACM Symposium on Computational Geometry, New York, June 1988, ACM, pp. 1-11.
7. H. Edelsbrunner, M.H. Overmars, R. Seidel, Some methods of computational geometry applied to computer graphics, Computer Vision Graphics and Image Processing 28 (1) (1984) 92-108.
8. H. Edelsbrunner, E.P. Mücke, A technique to cope with degenerate cases in geometric algorithms, in: Proceedings of the 4th Annual ACM Symposium on Computational Geometry, New York, June 1988, ACM, pp. 118-133.
9. S. Fortune, Polyhedral modeling with multiprecision integer arithmetic, Comput.-Aided Design 29 (2) (1997) 123-133.
10. M.T. Goodrich, A polygonal approach to hidden-line and hidden-surf ace elimination, CVGIP: Graphical Models and Image Processing 54 (1) (1992) 1-12.
11. M.T. Goodrich, L.J. Guibas, J. Hershberger, P.J. Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, in: Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 284-293.
12. D.H. Greene, F.F. Yao, Finite-resolution computational geometry, in: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, October 1986, pp. 143-152.
13. L. Guibas, D. Marimont, Rounding arrangements dynamically, in: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 190-199.
14. Z. Jaeger, R. Engleman, A. Sprecher, Statistics of structure within solid fragments studied by 2D simulation, Appl. Phys. 59 (12) (1986) 4048-4056.
15. J.W. Jaromczyk, G.T. Toussaint, Relative neighborhood graphs and their relatives, Proceedings of the IEEE 80 (9) (1992) 1502-1517.
16. H.G. Mairson, J. Stolfi, Reporting and counting intersections between two sets of line segments, in: R.A. Earnshaw (Ed.), Theoretical Foundations of Computer Graphics and CAD, Springer, Berlin, 1988, pp. 307-325.
17. V. Milenkovic, Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic, in: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, October 1989, pp. 500-506.
18. V. Milenkovic, Rounding face lattices in the plane, in: 1st Canadian Conference on Computational Geometry, 1989.
19. V. Milenkovic, Rounding face lattices in d dimensions, in: J. Urrutia (Ed.), Proceedings of the Second Canadian Conference on Computational Geometry, University of Ottawa, Ontario, August 1990, pp. 40-45.
20. V. Milenkovic, Robust polygon modeling, Comput.-Aided Design 25 (9) (1993) 246-266.
21. V. Milenkovic, L.R. Mackman, Finding compact coordinate representations for polygons and polyhedra, IBM J. Res. Development 34 (35) (1990) 753-769.
22. V.J. Milenkovic, Practical methods for set operations on polygons using exact arithmetic, in: Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 55-60.
23. K. Mulmuley, A fast planar partition algorithm, I, J. Symbolic Comput. 10 (3/4) (1990) 253-280.
24. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, New York, 1994.
25. J. Nievergelt, F.P. Preparata, Plane sweep algorithms for intersecting geometric figures, Comm. of the ACM 25 (10) (1982) 739-747.
26. J. Pach, M. Sharir, On vertical visibility in arrangements of segments and the queue size in the Bently-Ottman line sweeping algorithm, SIAM J. Comput. 20 (3) (1991) 460-470.
27. K. Sugihara, An intersection algorithm based on Delaunay triangulation, IEEE Comput. Graphics Appl. 12 (2) (1992) 59-67.
28. K. Sugihara, M. Iri, A solid modelling system free from topological inconsistency, J. Inform. Process. 12 (4) (1989) 380-393.
29. R.B. Tilove, A null-object detection algorithm for constructive solid geometry, Comm. of the ACM 27 (7) (1984) 684-694.
30. TIGER/LINE census files, 1990, technical documentation, Technical Report, Bureau of the Census, U.S. Department of Commerce, Washington, DC, 1991.
31. K. Wall, P.-E. Danielsson, A fast sequential method for polygonal approximation of digitized curves, Comput. Vision Graphics Image Process. 28 (2) (1984) 220-227.
32. Y.-F. Wu, P. Widmayer, M.D.E. Schlag, C.K. Wong, Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles, IEEE Trans. Comput. 36 (3) (1987) 321-331.