Skip to main content
SpringerLink
Log in

Searching for segments with largest relative overlap

  • II Mathematical Programming Algorithms
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 180))

  • 123 Accesses

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K. Intersection and Decomposition Algorithms for Planar Arrangements. Cambridge University Press, 1991.

    Google Scholar 

  2. Edelsbrunner, H., Guibas, L.J., Stolfi, J. Optimal point location in a monotone subdivision. SIAM J. Computing 15 (1986), 317–340.

    Article  MATH  MathSciNet  Google Scholar 

  3. Fortune, S. A sweepline algorithm for Voronoi diagrams. Algorithmica 2 (1987), 153–174.

    Article  MATH  MathSciNet  Google Scholar 

  4. Klein, R. Concrete and Abstract Voronoi Diagrams, Springer LNCS 400, 1989.

    Google Scholar 

  5. Mehlhorn, K., O’Dunlaing, C., Meiser, S. On the construction of abstract Voronoi diagrams. Discrete & Computational Geometry, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Fachbereich Mathematik, Freie Universität Berlin, Arnimallee 2-6, W1000, Berlin 33, Germany

    Franz Aurenhammer

  2. Institute für Informationsverarbeitung, Technische Universität Graz, Schiesstattgasse 4a, A-8010, Graz, Austria

    Gerd Stöckl

Authors
  1. Franz Aurenhammer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerd Stöckl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. D. Davisson A. G. J. MacFarlane H. Kwakernaak J. L. Massey Ya Z. Tsypkin A. J. Viterbi Peter Kall

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation