Abstract
A discrete one-to-one bitmap rotation called the Quasi Shear Rotation (QSR) is presented. This bitmap rotation is one-to-one, reversible and can have an arbitrary (non lattice) rotation center. The QSR represents so far the “best” choice of an one-to-one discrete rotation for a practical application.
Chapter PDF
Similar content being viewed by others
References
E. Andres, “Cercles discrets et rotations discrètes”, Ph.D. thesis (in french), Université Louis Pasteur, Strasbourg (France), Dec. 1992.
E. Andres and C. Sibata. “Choice of Integer Part Function for Computer Graphics”, submitted to IEEE TVCG in Oct. 1995.
Jacob, M-A., “Transformation of Digital Images by Discrete Affine Applications”, Computer & Graphics, 19, no. 3, pp. 373–389, Aug. 1995.
M-A. Jacob and E. Andres, “On Discrete Rotations”, Proc. of 5th Discrete Geometry Conference in Imagery, Clermont-Ferrand (France), Sept.1995.
A.W. Paeth, “A fast Algorithm for General Raster Rotation”, Proc. Graphics Interface '86, pp.77–81, Vancouver (Canada) May 1986.
A.W. Paeth, “A fast Algorithm for General Raster Rotation”, Graphics Gems, A. Grassner ed, Boston Academic, pp. 179–195, 1990.
J-P. Réveillés, “Géométrie Discrète, calculs en nombres entiers et algorithmique”, State Thesis (in french), Université Louis Pasteur, Strasbourg (France).
A. Tanaka et al., “A rotation method for raster image using skew transformation”, Proc. IEEE Conf. Comput. Vision and Pattern Rec., pp.272–277, Jun. 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andres, E. (1996). The Quasi-Shear rotation. In: Miguet, S., Montanvert, A., Ubéda, S. (eds) Discrete Geometry for Computer Imagery. DGCI 1996. Lecture Notes in Computer Science, vol 1176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62005-2_26
Download citation
DOI: https://doi.org/10.1007/3-540-62005-2_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62005-1
Online ISBN: 978-3-540-49595-6
eBook Packages: Springer Book Archive