Sciweavers

2342 search results - page 176 / 469
» Sublinear geometric algorithms
Sort
View
ECCV
2000
Springer
16 years 5 months ago
A Six Point Solution for Structure and Motion
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
Frederik Schaffalitzky, Andrew Zisserman, Richard ...
132
Voted
ICIP
2004
IEEE
16 years 5 months ago
Rotation and cropping resilient data hiding with zernike moments
Most digital data hiding schemes are sensitive to simple geometric attacks namely rotation, cropping, and scaling. Of these, rotational attacks possess the capability to not only ...
Palak K. Amin, Koduvayur P. Subbalakshmi
COMPGEOM
2004
ACM
15 years 8 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
147
Voted
SCA
2007
15 years 5 months ago
Arbitrary cutting of deformable tetrahedralized objects
We propose a flexible geometric algorithm for placing arbitrary cracks and incisions on tetrahedralized deformable objects. Although techniques based on remeshing can also accomm...
Eftychios Sifakis, Kevin G. Der, Ronald Fedkiw
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 4 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu