3 search results - page 1 / 1 » Space-efficient dynamic orthogonal point location, segment i... |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
COMPGEOM
2011
ACM
12 years 10 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...