Quasi-Affine Transformation in 3-D: Theory and Algorithms

Authors:
David Coeurjolly;Valentin Blot;Marie-Andrée Jacob-Da Col
Affiliations:
Université de Lyon, CNRS, LIRIS, UMR5205, France F-69622;Ecole Normale Supérieure de Lyon,;LSIIT-UMR 7005, Pole API Bd Sébastien Brant, Illkirch, France F-67412
Venue:
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Year:
2009

Citing 5
Cited 2

Computer graphics: principles and practice (2nd ed.)

Computer graphics: principles and practice (2nd ed.)
Asymptotically fast computation of Hermite normal forms of integer matrices

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Applications quasi-affines et pavages du plan discret

Theoretical Computer Science
Quasi-linear transformations and discrete tilings

Theoretical Computer Science
Quasi-affine transformation in higher dimension

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery

Quasi-linear transformations, numeration systems and fractals

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Combinatorial structure of rigid transformations in 2D digital images

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many applications and in many fields, algorithms can considerably be speed up if the underlying arithmetical computations are considered carefully. In this article, we present a theoretical analysis of affine transformations in dimension 3. More precisely, we investigate the arithmetical paving induced by the transformation to design fast algorithms.