5 search results - page 1 / 1 » Kinetic sorting and kinetic convex hulls |
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
SODA
2001
ACM
13 years 6 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...