Reliable line segment intersection testing

CAD Computer Aided Design

Volumn 32, Issue 12, 2000, Pages 737-745

  Gavrilova, M ^a   Rokne, J G ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC;

INTERSECTION TESTING; INTERVAL ARITHMETIC; INTERVAL FILTERS; LINE SEGMENTS;

COMPUTATIONAL GEOMETRY;

EID: 0033687743     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(00)00050-6     Document Type: Article

References (14)

1. CORE library, Version 1.2 Software, http://cs.nyu.edu/exact/core.
2. Douglas D. It makes me so CROSS. Introductory readings in geographical information systems. 1990;Taylor & Francis, London. p. 303-307.
3. Fortune S, Wyk, C. Efficient exact arithmetic for computational geometry. In: Proceedings of the 9th Annual ACM Symposium on Computational Geometry, 1993. p. 163-72.
4. Fortune S., Wyk C. Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Transactions on Graphics. 15:(3):1996;223-248.
5. Greene D, Yao F. Finite-resolution computational geometry. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986. p. 143-52.
6. Hobby J, Baird H. Degraded character image restoration. In: Proceedings of the Fifth Annual Symposium on Document Analysis and Image Retrieval, 1996. p. 233-45.
7. Hoffmann C. The problem of accuracy and robustness in geometric computation. IEEE Computing. 22:1989;31-42.
8. Jou E. Determine whether two line segments intersect. Modeling in computer graphics. Proceedings of the 10th Working Conference. 1991;Springer, Berlin. (p. 265-74).
9. Kao T., Knott G. An efficient and numerically correct algorithm for the 2D convex hull problem. BIT. 30:1990;311-331.
10. Karasick M., Lieber D., Nackman L. Efficient Delaunay triangulation using rational arithmetic. ACM Transactions of Graphics. 10:(1):1991;71-91.
11. Knott G, Jou D. A program to determine whether two line segments intersect. Technical Report CAR-TR-306, Department of Computer Science, University of Maryland, MD, 1987.
12. Milenkovic V. Double-precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic. In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989. p. 500-5.
13. Moore R. Interval analysis. 1966;Prentice Hall, Englewood Cliffs, NJ.
14. Ratschek H., Rokne J. Exact computation of the sign of a finite sum. Applied Mathematics and Computation. 99:1999;99-127.