43 search results - page 4 / 9 » Genus and the Geometry of the Cut Graph |
96
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
113
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
121
click to vote
MEMICS
2010
14 years 7 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
103
Voted
SCIA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...
123
Voted
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...