Sciweavers

235 search results - page 3 / 47
» The Complexity of Separating Points in the Plane
Sort
View
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 6 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
3DIM
2003
IEEE
13 years 11 months ago
A Fast Point-to-Tangent Plane Technique for Multi-view Registration
This paper addresses a registration refinement problem and presents an accurate and fast Point-to-(Tangent) Plane technique. Point-to-Plane approach is known to be very accurate ...
Soon-Yong Park, Murali Subbarao
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 7 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
CVPR
2005
IEEE
14 years 8 months ago
Complex 3D Shape Recovery Using a Dual-Space Approach
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
Chen Liang, Kwan-Yee Kenneth Wong
ECCV
1998
Springer
14 years 8 months ago
From Reference Frames to Reference Planes: Multi-View Parallax Geometry and Applications
Abstract. This paper presents a new framework for analyzing the geometry of multiple 3D scene points from multiple uncalibrated images, based on decomposing the projection of these...
Michal Irani, P. Anandan, Daphna Weinshall