22 search results - page 4 / 5 » Computing Triangulations Using Oriented Matroids |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
ICRA
1995
IEEE
14 years 2 months ago
1995
IEEE
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
IROS
2009
IEEE
14 years 5 months ago
2009
IEEE
— The problem of accurate 6-DoF pose estimation of 3D objects based on their shape has so far been solved only for specific object geometries. Edge-based recognition and trackin...
ECCV
2008
Springer
15 years 22 days 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...
SGP
2007
14 years 1 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...