Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01092500
Contributor : Valentin Blot <>
Submitted on : Monday, December 8, 2014 - 6:48:26 PM
Last modification on : Wednesday, November 20, 2019 - 3:03:01 AM
Document(s) archivé(s) le : Saturday, April 15, 2017 - 4:37:07 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Citation

David Coeurjolly, Valentin Blot, Marie-Andrée Jacob-da Col. Quasi-Affine Transformation in 3-D: Theory and Algorithms. Combinatorial Image Analysis, Nov 2009, Playa del Carmen, Mexico. pp.68 - 81, ⟨10.1007/978-3-642-10210-3_6⟩. ⟨hal-01092500⟩

Share

Metrics

Record views

555

Files downloads

494