235 search results - page 3 / 47 » The Complexity of Separating Points in the Plane |
ALGORITHMICA
2010
14 years 11 months ago
2010
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...
3DIM
2003
IEEE
15 years 4 months ago
2003
IEEE
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 ...
SODA
2008
ACM
15 years 24 days ago
2008
ACM
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...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
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...
118
click to vote
ECCV
1998
Springer
16 years 1 months ago
1998
Springer
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...