Searching for segments with largest relative overlap
- 96 Downloads
Let S be a set of n possibly intersecting line segments on the x-axis. A data structure is developed that — for an arbitrary query segment σ — reports in O(log n) time a segment in S which yields the largest relative overlap with σ. The structure needs O(n log n) time and O(n) space for construction. These bounds are asymptotically optimal.
Unable to display preview. Download preview PDF.
- Agarwal, P.K. Intersection and Decomposition Algorithms for Planar Arrangements. Cambridge University Press, 1991.Google Scholar
- Klein, R. Concrete and Abstract Voronoi Diagrams, Springer LNCS 400, 1989.Google Scholar
- Mehlhorn, K., O’Dunlaing, C., Meiser, S. On the construction of abstract Voronoi diagrams. Discrete & Computational Geometry, to appear.Google Scholar