skip to main content
10.1145/220279.220302acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article
Free Access

An optimal algorithm for finding segments intersections

Authors Info & Claims
Published:01 September 1995Publication History
First page image

References

  1. 1.Ben-Or, M. Lower bounds for algebraic computation trees. In Proceedings of the 15th Annual ACM Symposium Theory of Computing. (1983), 80-86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Bentley, J.L., and Ottman, T. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28 (1979), 643-647.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Chazelle, B. Filtering search: A new approach to query-answering. SIAM J. Comput. Vol. 15 (1986), 703-725. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Chazelle, B. Reporting and counting segment intersections. J. Comput. Sys. Sc~. 32 (1986), 156-182. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Chazelle, B., and Edelsbrunner, H. An optimal algorithm for intersecting line segments in the plane. Journal of the A CM, Vol. 39 (1992), 1-54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Clarkson, K.L., and Shor, P.W. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, Vol. d (1989), 387-421.Google ScholarGoogle Scholar
  7. 7.Edelsbrunner, H., Guibas L.J., Stolfi J. Optimal point location in monotone subdivision. SlAM J. Comput. Vo1.15(2) (1986), 317-340. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Lueker, G. A data structure for orthogonal range queries. In Proceedings of the 19th annual IEEE Symposium on Foundations of Computer Science.(1979), 28-34.Google ScholarGoogle Scholar
  9. 9.Mulmuley, K. A fast planar partition algorithm. In Proceedings of the 29th annual IEEE $yrnpos~um on Foundations of Computer Science.(1988), 580- 589.Google ScholarGoogle Scholar
  10. 10.Preparata, F.P., and Shamos, M.I. Computatzonal geometry: An ~ntroduction. Springer-Verlag, New York, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Willard, D. Pollgon retrieval. SIAM J. Coraput. 1/ol. ll (1982), 149-105.Google ScholarGoogle Scholar

Index Terms

  1. An optimal algorithm for finding segments intersections

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SCG '95: Proceedings of the eleventh annual symposium on Computational geometry
          September 1995
          456 pages
          ISBN:0897917243
          DOI:10.1145/220279
          • Chairman:
          • Jack Snoeyink

          Copyright © 1995 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 September 1995

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          SCG '95 Paper Acceptance Rate59of129submissions,46%Overall Acceptance Rate625of1,685submissions,37%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader