Sciweavers

115 search results - page 7 / 23
» Numerical decomposition of geometric constraints
Sort
View
CIARP
2004
Springer
14 years 3 days ago
Refined Method for the Fast and Exact Computation of Moment Invariants
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
Juan Humberto Sossa Azuela, Jan Flusser
ICCV
2007
IEEE
14 years 8 months ago
Geometric Integrability and Consistency of 3D Point Clouds
Numerous applications processing 3D point data will gain from the ability to estimate reliably normals and differential geometric properties. Normal estimates are notoriously nois...
George Kamberov, Gerda Kamberova
CG
2005
Springer
13 years 6 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 6 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
PPL
2006
93views more  PPL 2006»
13 years 6 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl