Skip to main content
Log in

Stabbing line segments

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

An algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane is presented. As a matter of fact, the algorithm computes a description of all stabbing lines. A purely geometric fact is proved which infers that this description requiresO(n) space to be specified. Our algorithm computes it inO(n logn) time which is optimal in the worst case.

Using the description of the stabbing lines, we are able to decide inO(logn) time whether or not a specified line is a stabbing line. Finally, the problem of maintaining the description of all stabbing lines while inserting and deleting line segments is addressed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. Q. Brown,Geometric transforms for fast geometric algorithms, Report CMU-CS-80-101, Department of Computer Science, Carnegie-Mellon University (1980).

  2. H. Edelsbrunner, D. G. Kirkpatrick and H. A. Maurer,Polygonal intersection searching, Report F64, Institut für Informationsverarbeitung, Technical University of Graz (1981).

  3. H. Edelsbrunner, M. H. Overmars and D. Wood,Graphics in flatland: A case study, Report F79, Institut für Informationsverarbeitung, Technical University of Graz (1981).

  4. M. L. Fredman,The inherent complexity of dynamic data structures which accommodate range queries, Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (1980), 191–199.

  5. I. G. Gowda and D. G. Kirkpatrick,Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures, Proceedings of the 18th Annual Allerton Conference on Communication, Control, and Computing (1980), 1–10.

  6. D. T. Lee,Proximity and reachability in the plane, Report R-831, Coordinated Science Laboratory, University of Illinois (1978).

  7. D. T. Lee and F. P. Preparata,Finding shortest paths with parallel segments as obstacles, In preparation.

  8. M. H. Overmars,Dynamization of order decomposable set problems, Journal of Algorithms 2 (1981), 245–260.

    Google Scholar 

  9. M. I. Shamos and D. Hoey,Geometric intersection problems, Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science (1976), 208–215.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edelsbrunner, H., Maurer, H.A., Preparata, F.P. et al. Stabbing line segments. BIT 22, 274–281 (1982). https://doi.org/10.1007/BF01934440

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934440

Keywords

Navigation