SIAMCOMP
1998
13 years 11 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
ALGORITHMICA
1998
13 years 11 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
COMGEO
2004
ACM
13 years 11 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
SODA
2008
ACM
14 years 26 days 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...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...