Author:
Klein Rolf,Driemel Anne,Haverkort Herman
Publisher
Springer Fachmedien Wiesbaden
Reference11 articles.
1. I. J. Balaban. An optimal algorithm for finding segment intersections. In Proc. 11th Annu. ACM Sympos. Comput. Geom., S. 211–219, 1995.
2. J. L. Bentley. Programming Pearls. Addison-Wesley, Reading, MA, 1985.
3. J. L. Bentley, T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28(9):643–647, 1979.
4. C. Burnikel, K. Mehlhorn, S. Schirra. On degeneracy in geometric computations. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, S. 16–23, 1994.
5. B. Chazelle, H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. ACM, 39(1):1–54, 1992.