1949 search results - page 108 / 390 » Random graphs on surfaces |
141
click to vote
3DOR
2008
15 years 6 months ago
2008
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...
172
click to vote
SGP
2004
15 years 6 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
324
click to vote
PAMI
2010
15 years 2 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
145
click to vote
MICCAI
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
151
click to vote
WDAG
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...