39 search results - page 5 / 8 » On minimally 3-connected graphs on a surface |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
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...
COMBINATORICS
2002
13 years 7 months ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
CVPR
2008
IEEE
13 years 8 months ago
2008
IEEE
Efficient segmentation of globally optimal surfaces in volumetric images is a central problem in many medical image analysis applications. Intra-class variance has been successful...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
VAST
2004
ACM
14 years 1 months ago
2004
ACM
Digitizing real-life objects via range scanners, stereo vision or tactile sensors usually requires the composition of multiple range images. In this paper we exploit intensity ima...