62 search results - page 1 / 13 » Global minimum cuts in surface embedded graphs |
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...