Skip to main content

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5852))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blot, V., Coeurjolly, D.: Quasi-affine transform in higher dimension. In: 15th International Conference on Discrete Geometry for Computer Imagery. LNCS. Springer, Heidelberg (submitted)

    Google Scholar 

  2. Blot, V., Coeurjolly, D.: Quasi-affine transform in higher dimension. Technical Report RR–LIRIS-2009-010, Laboratoire LIRIS (April 2009), http://liris.cnrs.fr/publis?id=3853

  3. Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics: Principles and Practice, 2nd edn. Addison-Wesley, Reading (1990)

    Google Scholar 

  4. Jacob, M.: Applications quasi-affines. PhD thesis, Université Louis Pasteur, Strasbourg, France (1993)

    Google Scholar 

  5. Jacob, M.: Transformation of digital images by discrete affine applications. Computers & Graphics 19(3), 373–389 (1995)

    Article  Google Scholar 

  6. Jacob-Da Col, M.: Applications quasi-affines et pavages du plan discret. Theoretical Computer Science 259(1-2), 245–269 (2001), http://dpt-info.u-strasbg.fr/~jacob/articles/paving.pdf

    Article  MATH  MathSciNet  Google Scholar 

  7. Jacob-Da Col, M.A., Tellier, P.: Quasi-linear transformations and discrete tilings. Theoretical Computer Science 410(21-23), 2126–2134 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Nehlig, P.: Applications quasi affines: pavages par images réciproques. Theoretical Computer Science 156(1-2), 1–38 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nehlig, P., Ghazanfarpour, D.: Affine Texture Mapping and Antialiasing Using Integer Arithmetic. Computer Graphics Forum 11(3), 227–236 (1992)

    Article  Google Scholar 

  10. Storjohann, A., Labahn, G.: Asymptotically fast computation of hermite normal forms of integer matrices. In: ISSAC 1996: Proceedings of the 1996 international symposium on Symbolic and algebraic computation, pp. 259–266. ACM, New York (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-10210-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10210-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10208-0

  • Online ISBN: 978-3-642-10210-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics