6.838, Computational Geometry; Fall 2001

Point Location

Sergi Elizalde & David Pritchard


Assumptions / Simplifications

Want to deal with a bounded region instead of the entire plane:

- look at all vertices and determine xmin/max, ymin/max

- put a bounding rectangle around all of the points

- when queried, if query lies outside the box then q lies in the unbounded face and we are done; hereforth we will assume q lies inside the bounding box

Since we are dealing with vertical lines, it will be easier to assume all x-coordinates of all vertices and of the query point are distinct

We generalize from a planar subdivision to an arbitrary collection of non-crossing segments