Reporting and counting intersections of lines within a polygon

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Asano, T. (1994). Reporting and counting intersections of lines within a polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 652–659). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_234

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free