Sciweavers

110 search results - page 5 / 22
» Measuring linearity of planar point sets
Sort
View
WADS
1993
Springer
115views Algorithms» more  WADS 1993»
15 years 3 months ago
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
Marshall W. Bern, David Eppstein, Shang-Hua Teng
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 3 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
106
Voted
ICCV
2001
IEEE
16 years 1 months ago
Plane-based Projective Reconstruction
A linear method for computing a projective reconstruction from a large number of images is presented and then evaluated. The method uses planar homographies between views to linea...
Robert Kaucic, Richard I. Hartley, Nicolas Y. Dano
ECCV
1998
Springer
15 years 3 months ago
On Degeneracy of Linear Reconstruction from Three Views: Linear Line Complex and Applications
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
Gideon P. Stein, Amnon Shashua
ICIP
2005
IEEE
16 years 1 months ago
An efficient Rao-Blackwellized particle filter for object tracking
In this paper we present a technique for the tracking of textured almost planar object. The target is modeled as a noisy planar cloud of points. The tracking is led with an approp...
Étienne Mémin, Elise Arnaud