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

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.
Type de document :
Communication dans un congrès
Department of Automatic Control, Centro de Investigación y de Estudios Avanzados (CINVESTAV- IPN); Department of Computer Science, State University of New York at Fredonia. Combinatorial Image Analysis, Nov 2009, Playa del Carmen, Mexico. Springer Berlin Heidelberg, 5852, pp.68 - 81, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-10210-3_6>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01092500
Contributeur : Valentin Blot <>
Soumis le : lundi 8 décembre 2014 - 18:48:26
Dernière modification le : mardi 23 mai 2017 - 11:22:45
Document(s) archivé(s) le : samedi 15 avril 2017 - 04:37:07

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

David Coeurjolly, Valentin Blot, Marie-Andrée Jacob-Da Col. Quasi-Affine Transformation in 3-D: Theory and Algorithms. Department of Automatic Control, Centro de Investigación y de Estudios Avanzados (CINVESTAV- IPN); Department of Computer Science, State University of New York at Fredonia. Combinatorial Image Analysis, Nov 2009, Playa del Carmen, Mexico. Springer Berlin Heidelberg, 5852, pp.68 - 81, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-10210-3_6>. <hal-01092500>

Partager

Métriques

Consultations de
la notice

186

Téléchargements du document

139