152 search results - page 3 / 31 » Expected time analysis for Delaunay point location |
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
118
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
73
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family...
SODA
1997
ACM
14 years 10 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...