32 search results - page 3 / 7 » Dual graph homomorphism functions |
ICCV
2007
IEEE
14 years 8 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...
CVPR
2006
IEEE
14 years 8 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...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CAGD
2006
13 years 6 months ago
2006
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...