Sciweavers

37 search results - page 1 / 8
» Optimally cutting a surface into a disk
Sort
View
CORR
2002
Springer
79views Education» more  CORR 2002»
13 years 4 months ago
Optimally cutting a surface into a disk
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
Jeff Erickson, Sariel Har-Peled
FOCS
2002
IEEE
13 years 10 months ago
Optimal System of Loops on an Orientable Surface
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
Éric Colin de Verdière, Francis Laza...
IJCV
2006
81views more  IJCV 2006»
13 years 4 months ago
A Surface Reconstruction Method Using Global Graph Cut Optimization
Sylvain Paris, François X. Sillion, Long Qu...
ICPR
2004
IEEE
14 years 6 months ago
Reconstructing a Dynamic Surface from Video Sequences Using Graph Cuts in 4D Space-Time
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 ...
Narendra Ahuja, Ning Xu, Tianli Yu
CVPR
2010
IEEE
14 years 1 months ago
Discrete minimum ratio curves and surfaces
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...
Fred Nicolls, Phil Torr