Quasi-Affine Transformation in Higher Dimension

Valentin Blot (1) , David Coeurjolly (2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 M2DisCo - Geometry Processing and Constrained Optimization

In many applications and in many fields, algorithms can con-siderably be speed up if the underlying arithmetical computations are considered carefully. In this article, we present a theoretical analysis of discrete affine transformations in higher dimension. More precisely, we investigate the arithmetical paving structure induced by the transforma-tion to design fast algorithms.

Domaines: Traitement des images [eess.IV]

Valentin Blot, David Coeurjolly. Quasi-Affine Transformation in Higher Dimension. Discrete Geometry for Computer Imagery, Sep 2009, Montréal, Canada. pp.493 - 504, ⟨10.1007/978-3-642-04397-0_42⟩. ⟨hal-01092499⟩