Abstract
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.
The first author was supported by the ESPRIT II Basic Research Action of the European Community under contract No. 3075 (project ALCOM)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K. Intersection and Decomposition Algorithms for Planar Arrangements. Cambridge University Press, 1991.
Edelsbrunner, H., Guibas, L.J., Stolfi, J. Optimal point location in a monotone subdivision. SIAM J. Computing 15 (1986), 317–340.
Fortune, S. A sweepline algorithm for Voronoi diagrams. Algorithmica 2 (1987), 153–174.
Klein, R. Concrete and Abstract Voronoi Diagrams, Springer LNCS 400, 1989.
Mehlhorn, K., O’Dunlaing, C., Meiser, S. On the construction of abstract Voronoi diagrams. Discrete & Computational Geometry, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 International Federation for Information Processing
About this paper
Cite this paper
Aurenhammer, F., Stöckl, G. (1992). Searching for segments with largest relative overlap. In: Davisson, L.D., et al. System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0113274
Download citation
DOI: https://doi.org/10.1007/BFb0113274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55577-3
Online ISBN: 978-3-540-47220-9
eBook Packages: Springer Book Archive