137 search results - page 3 / 28 » Maintaining the Approximate Width of a Set of Points in the ... |
WADS
2005
Springer
14 years 25 days ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
SODA
1994
ACM
13 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...