JGT
2006
13 years 4 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
DM
2007
13 years 4 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
CATS
2008
13 years 6 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...