Sciweavers

3 search results - page 1 / 1
» Efficient Computation of Minimal Point Algebra Constraints b...
Sort
View
CP
2007
Springer
13 years 9 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ECCV
2006
Springer
14 years 7 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
CVPR
2011
IEEE
12 years 10 months ago
Reduced Epipolar Cost for Accelerated Incremental SfM
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
A. L. Rodriguez, P E. Lopez-de-Teruel, A. Ruiz