Reporting and counting intersections of lines within a polygon
This paper presents efficient algorithms for reporting and counting intersections of line segments in the plane in an output-sensitive manner in several special cases. We also consider how to report intersections allowing degenerate interseections of more than two lines in optimal time.
Unable to display preview. Download preview PDF.
- [ASO86]Ta. Asano, M. Sato and T. Ohtsuki: “Computational Geometry Algorithms”, in “Layout Design and Verification”, edited by T. Ohtsuki, Chapter 9, pp.295–347, Elsevier Science Publishers (North-Holland), 1986.Google Scholar
- [AGT]Te. Asano, L. J. Guibas and T. Tokuyama: “Walking in an Arrangement of Lines Topologically”, International Journal of Computational Geometry and Applications, to appear.Google Scholar
- [BMS94]C. Burnikel, K. Mehlhorn, and S. Schirra: “On Degeneracy in Geometric Computations,” Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.16–23 (1994).Google Scholar
- [BO79]J.L. Bentley and T. Ottman: “Algorithms for Reporting and Counting Geometric Intersections”, IEEE Trans. on Comput., vol.C-28, pp.643–647, 1979.Google Scholar
- [CE92]B. Chazelle and H. Edelsbrunner: “An optimal algorithm for intersecting line segments in the plane”, J. ACM, 39, pp.671–696, 1992.Google Scholar
- [EG89]H. Edelsbrunner and L. J. Guibas: “Topologically Sweeping an Arrangement”, J. Comp. and Sys. Sci., 38, pp.165–194, 1989.Google Scholar