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

  • David Coeurjolly
  • Valentin Blot
  • Marie-Andrée Jacob-Da Col
Conference paper

DOI: 10.1007/978-3-642-10210-3_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5852)
Cite this paper as:
Coeurjolly D., Blot V., Jacob-Da Col MA. (2009) Quasi-Affine Transformation in 3-D: Theory and Algorithms. In: Wiederhold P., Barneva R.P. (eds) Combinatorial Image Analysis. IWCIA 2009. Lecture Notes in Computer Science, vol 5852. Springer, Berlin, Heidelberg

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.

Keywords

quasi-affine transform periodic tiling arithmetic image transformation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • David Coeurjolly
    • 1
  • Valentin Blot
    • 2
  • Marie-Andrée Jacob-Da Col
    • 3
  1. 1.Université de Lyon, CNRS, LIRIS, UMR5205France
  2. 2.Ecole Normale Supérieure de Lyon 
  3. 3.LSIIT-UMR 7005, Pole API Bd Sébastien BrantIllkirchFrance

Personalised recommendations