Skip to main content
SpringerLink
Log in

Point Location

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 44 Accesses

Years and Authors of Summarized Original Work

  • 1983; Kirkpatrick

  • 1991; Seidel

  • 2009; Haran, Halperin

Point Location, Fig. 1
figure 1621 figure 1621

The paths traversed by (a) a straight-line walk, (b) an orthogonal walk, and (c) a visibility walk. Note that any path following the arrows is possible in the visibility walk

Full size image

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Chazelle B (1991) Triangulation a simple polygon in linear time. Discret Comput Geom 6(1):485–524

    Article  MathSciNet  MATH  Google Scholar 

  2. Devillers O (2002) The Delaunay hierarchy. Int J Found Comput Sci 13:163–181

    Article  MathSciNet  MATH  Google Scholar 

  3. Devillers O, Pion S, Teillaud M (2002) Walking in a triangulation. Int J Found Comput Sci 13:181–199

    Article  MathSciNet  MATH  Google Scholar 

  4. Devroye L, Lemaire C, Moreau JM (2004) Expected time analysis for Delaunay point location. Comput Geom Theory Appl 29:61–89

    Article  MathSciNet  MATH  Google Scholar 

  5. Devroye L, Mücke E, Zhu B (1998) A note on point location in Delaunay triangulations of random points. Algorithmica (Spec Issue Aver Case Anal Algorithms) 22(4):477–482

    MathSciNet  MATH  Google Scholar 

  6. Dobkin D, Lipton RJ (1976) Multidimensional searching problems. SIAM J Comput 5(2):181–186

    Article  MathSciNet  MATH  Google Scholar 

  7. Haran I, Halperin D (2009) An experimental study of point location in planar arrangements in CGAL. J Exp Algorithm 13:Article 3

    Google Scholar 

  8. Hemmer M, Kleinbort M, Halperin D (2012) Improved implementation of point location in general two-dimensional subdivisions. In: Proceedings of the 20th European symposium on algorithms (ESA), Ljubljana, pp 611–623

    Google Scholar 

  9. Kirkpatrick D (1983) Optimal search in planer subdivisions. SIAM J Comput 12(1):28–35

    Article  MathSciNet  MATH  Google Scholar 

  10. Mulmuley K (1990) A fast planar partition algorithm, I. J Symb Comput 10(3):253–280

    Article  MathSciNet  MATH  Google Scholar 

  11. Sarnak N, Tarjan RE (1986) Planar point location using persistent search trees. Commun ACM 29(7):669–679

    Article  MathSciNet  MATH  Google Scholar 

  12. Seidel R (1991) A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput Geom: Theory Appl 1(1):51–64

    Article  MathSciNet  MATH  Google Scholar 

  13. Seidel R, Adamy U (2000) On the exact worst case query complexity of planar point location. J Algorithms 37:189–217

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Sendai, Japan

    Marcel Roeloffzen

Authors
  1. Marcel Roeloffzen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcel Roeloffzen .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Roeloffzen, M. (2016). Point Location. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_587

Download citation

Publish with us

Policies and ethics

Search

Navigation