### Abstract

Let S be a connected planar polygonal subdivision with n edges that we want to preprocess for point-location queries, and where we are given the probability γ_{i} that the query point lies in a polygon P_{i} of S. We show how to preprocess S such that the query time for a point p∈P_{i} depends on γ_{i} and, in addition, on the distance from p to the boundary of P_{i} - the further away from the boundary, the faster the query. More precisely, we show that a point-location query can be answered in time O(min (logn, 1+log area(P_{i})/γ_{i}Δ_{p}^{2})), where Δ_{p} is the shortest Euclidean distance of the query point p to the boundary of P_{i}. Our structure uses O(n) space and O(nlogn) preprocessing time. It is based on a decomposition of the regions of S into convex quadrilaterals and triangles with the following property: for any point p ∈ P_{i}, the quadrilateral or triangle containing p has area Ω(Δ_{p}^{2}). For the special case where S is a subdivision of the unit square and γ_{i}=area(P_{i}), we present a simpler solution that achieves a query time of O(min(logn,log 1/Δ_{p}^{2})). The latter solution can be extended to convex subdivisions in three dimensions.

Original language | English (US) |
---|---|

Pages (from-to) | 17-31 |

Number of pages | 15 |

Journal | Computational Geometry: Theory and Applications |

Volume | 54 |

DOIs | |

State | Published - Apr 1 2016 |

### Fingerprint

### Keywords

- Mesh generation
- Point location
- Quadtree

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Computer Science Applications
- Computational Mathematics
- Control and Optimization
- Geometry and Topology

### Cite this

*Computational Geometry: Theory and Applications*,

*54*, 17-31. https://doi.org/10.1016/j.comgeo.2016.02.001

**Distance-sensitive planar point location.** / Aronov, Boris; De Berg, Mark; Eppstein, David; Roeloffzen, Marcel; Speckmann, Bettina.

Research output: Contribution to journal › Article

*Computational Geometry: Theory and Applications*, vol. 54, pp. 17-31. https://doi.org/10.1016/j.comgeo.2016.02.001

}

TY - JOUR

T1 - Distance-sensitive planar point location

AU - Aronov, Boris

AU - De Berg, Mark

AU - Eppstein, David

AU - Roeloffzen, Marcel

AU - Speckmann, Bettina

PY - 2016/4/1

Y1 - 2016/4/1

N2 - Let S be a connected planar polygonal subdivision with n edges that we want to preprocess for point-location queries, and where we are given the probability γi that the query point lies in a polygon Pi of S. We show how to preprocess S such that the query time for a point p∈Pi depends on γi and, in addition, on the distance from p to the boundary of Pi - the further away from the boundary, the faster the query. More precisely, we show that a point-location query can be answered in time O(min (logn, 1+log area(Pi)/γiΔp2)), where Δp is the shortest Euclidean distance of the query point p to the boundary of Pi. Our structure uses O(n) space and O(nlogn) preprocessing time. It is based on a decomposition of the regions of S into convex quadrilaterals and triangles with the following property: for any point p ∈ Pi, the quadrilateral or triangle containing p has area Ω(Δp2). For the special case where S is a subdivision of the unit square and γi=area(Pi), we present a simpler solution that achieves a query time of O(min(logn,log 1/Δp2)). The latter solution can be extended to convex subdivisions in three dimensions.

AB - Let S be a connected planar polygonal subdivision with n edges that we want to preprocess for point-location queries, and where we are given the probability γi that the query point lies in a polygon Pi of S. We show how to preprocess S such that the query time for a point p∈Pi depends on γi and, in addition, on the distance from p to the boundary of Pi - the further away from the boundary, the faster the query. More precisely, we show that a point-location query can be answered in time O(min (logn, 1+log area(Pi)/γiΔp2)), where Δp is the shortest Euclidean distance of the query point p to the boundary of Pi. Our structure uses O(n) space and O(nlogn) preprocessing time. It is based on a decomposition of the regions of S into convex quadrilaterals and triangles with the following property: for any point p ∈ Pi, the quadrilateral or triangle containing p has area Ω(Δp2). For the special case where S is a subdivision of the unit square and γi=area(Pi), we present a simpler solution that achieves a query time of O(min(logn,log 1/Δp2)). The latter solution can be extended to convex subdivisions in three dimensions.

KW - Mesh generation

KW - Point location

KW - Quadtree

UR - http://www.scopus.com/inward/record.url?scp=84958206282&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958206282&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2016.02.001

DO - 10.1016/j.comgeo.2016.02.001

M3 - Article

AN - SCOPUS:84958206282

VL - 54

SP - 17

EP - 31

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

ER -