237 search results - page 1 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
90
Voted
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...
SIAMCOMP
1998
14 years 9 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...
SODA
2001
ACM
14 years 10 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
COMGEO
2004
ACM
14 years 9 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...
174
click to vote
STOC
2003
ACM
15 years 9 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...