205 search results - page 27 / 41 » On Deletion in Delaunay Triangulations |
COMPGEOM
2004
ACM
14 years 1 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 ...
CCCG
2006
13 years 9 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...