208 search results - page 27 / 42 » Blocking delaunay triangulations |
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 1 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...
ICDCS
2002
IEEE
14 years 10 days ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
SMA
1995
ACM
13 years 11 months ago
1995
ACM
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...