120 search results - page 6 / 24 » On locally Delaunay geometric graphs |
ICCSA
2004
Springer
14 years 4 months ago
2004
Springer
VISUALIZATION
2000
IEEE
14 years 3 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
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...
JDA
2007
13 years 10 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
IMECS
2007
14 years 8 days ago
2007
—Proteins are the main players in the game of life. Good understanding of their structures, functions, and behaviors leads to good understanding of drugs, diseases, and thus our ...