4850 search results - page 389 / 970 » Proof and Computation in Geometry |
153
Voted
CORR
2004
Springer
15 years 6 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
188
Voted
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
215
Voted
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper, we propose a novel method to establish temporal correspondence between the frames of two videos. 3D epipolar geometry is used to eliminate the distortion generated ...
207
Voted
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents a framework to reconstruct a scene captured in multiple camera views based on a prior model of the scene geometry. The framework is applied to the capture of a...
183
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...