Reporting and counting segment intersections
From MaRDI portal
Publication:1821557
DOI10.1016/0022-0000(86)90025-5zbMath0616.68042MaRDI QIDQ1821557
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(86)90025-5
68Q25: Analysis of algorithms and problem complexity
Related Items
On counting pairs of intersecting segments and off-line triangle range searching, Computing the convex hull in a hammock, A tight upper bound for the number of intersections between two rectangulars paths, Line-segment intersection reporting in parallel, Algorithms for bichromatic line-segment problems and polyhedral terrains, Extremal polygon containment problems, Orthogonal queries in segments, Constructing arrangements optimally in parallel, New lower bounds for Hopcroft's problem