Bentley, J. L. and Ottmann, T. A. "Algorithms for Reporting and Counting Geometric Intersections." IEEE Trans. Comput.C-28,
643-647, 1979.Erickson, J. "Computational Geometry Code."
http://compgeom.cs.uiuc.edu/~jeffe/compgeom/code.html#poly.Hobby,
J. "Practical Segment Intersection with Finite Precision Output." Comput.
Geom. Th. Appl.13, 1999.Leonov, M. "Comparison of the
Different Algorithms for Polygon Boolean Operations." http://home.attbi.com/~msleonov/pbcomp.html.Mehlhorn,
K. and Naher, S. "Implementation of a Sweep Line Algorithm for the Straight
Line Segment Intersection Problem." Max-Planck-Institut fur Informatik, MPI-I-94-160,
1994.Preparata, F. R. and Shamos, M. I. Computational
Geometry: An Introduction. New York: Springer-Verlag, 1985.Vatti,
B. R. "A Generic Solution to Polygon Clipping." Commun. ACM35,
56-63, 1992.Zalik, B.; Gombosi, M.; and Podgorelec, D. "A Quick
Intersection Algorithm for Arbitrary Polygons." In SCCG98 Conf. on Comput.
Graphics and Its Applications (Ed. L. Szirmay-Kalos). pp. 195-204,
1998.
TOPICS
