1730 search results - page 338 / 346 » Algebra and Computation |
COMPGEOM
2004
ACM
14 years 28 days 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 ...
ISPA
2004
Springer
14 years 26 days ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
COMPGEOM
2010
ACM
14 years 17 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...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
ECCV
2010
Springer
14 years 7 days ago
2010
Springer
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a ...