Quasi-Affine Transformation in Higher Dimension

  • Valentin Blot
  • David Coeurjolly
Conference paper

DOI: 10.1007/978-3-642-04397-0_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5810)
Cite this paper as:
Blot V., Coeurjolly D. (2009) Quasi-Affine Transformation in Higher Dimension. In: Brlek S., Reutenauer C., Provençal X. (eds) Discrete Geometry for Computer Imagery. DGCI 2009. Lecture Notes in Computer Science, vol 5810. 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 discrete affine transformations in higher dimension. More precisely, we investigate the arithmetical paving structure induced by the transformation to design fast algorithms.

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

  • Valentin Blot
    • 1
  • David Coeurjolly
    • 1
  1. 1.LIRIS, UMR5205Université de Lyon, CNRS, Ecole Normale Supérieure de Lyon, Université Lyon 1France

Personalised recommendations