In this paper we are proposing a way to perform bijective digital rotations on a triangular cell grid. The method is based on a decomposition of a rotation into shear transforms and on a way to transform the original triangle centroids in order to have a regular grid. The rotation method works for any angle and achieves an average distance between the digital rotated point and the continuous rotated point of about 0.5 (with 1.0 the side of a triangle and a distance between two neighboring triangle centroids of 0.57)
A fast raster rotation algorithm based on nearest-neighbour interpolation is described. Essentially,...
International audienceBijectivity of digitized linear transformations is crucial when transforming 2...
Abstract: Rotation of vectors through fixed and known angles has wide applications in robotics, digi...
In this paper we are proposing a way to perform bijective digital rotations on a triangular cell gri...
In this paper, a new bijective digital rotation algorithm for the hexagonal grid is proposed. The me...
International audienceIn this paper, we study 3D rotations on grid points computed by using only int...
In this paper, a new bijective reflection algorithm in two dimensions is proposed along with an asso...
AbstractIn this paper, we study 3D rotations on grid points computed by using only integers. For tha...
International audienceIn this paper, we focus on 3D rotations on grid points computed by using only ...
International audienceEuclidean rotations in R^n are bijective and isometric maps. Nevertheless, the...
Submitted to Journal of Mathematical Imaging and Vision.International audienceDigitized rotations on...
In this work, we propose a new image rotation algorithm. The main feature of our approach is the sym...
Image rotation is one of main pre-processing steps for image processing or image pattern recognition...
International audienceRotations in the discrete plane are important for many applications such as im...
In this work, we propose a new image rotation algorithm. The main feature of our approach is the sym...
A fast raster rotation algorithm based on nearest-neighbour interpolation is described. Essentially,...
International audienceBijectivity of digitized linear transformations is crucial when transforming 2...
Abstract: Rotation of vectors through fixed and known angles has wide applications in robotics, digi...
In this paper we are proposing a way to perform bijective digital rotations on a triangular cell gri...
In this paper, a new bijective digital rotation algorithm for the hexagonal grid is proposed. The me...
International audienceIn this paper, we study 3D rotations on grid points computed by using only int...
In this paper, a new bijective reflection algorithm in two dimensions is proposed along with an asso...
AbstractIn this paper, we study 3D rotations on grid points computed by using only integers. For tha...
International audienceIn this paper, we focus on 3D rotations on grid points computed by using only ...
International audienceEuclidean rotations in R^n are bijective and isometric maps. Nevertheless, the...
Submitted to Journal of Mathematical Imaging and Vision.International audienceDigitized rotations on...
In this work, we propose a new image rotation algorithm. The main feature of our approach is the sym...
Image rotation is one of main pre-processing steps for image processing or image pattern recognition...
International audienceRotations in the discrete plane are important for many applications such as im...
In this work, we propose a new image rotation algorithm. The main feature of our approach is the sym...
A fast raster rotation algorithm based on nearest-neighbour interpolation is described. Essentially,...
International audienceBijectivity of digitized linear transformations is crucial when transforming 2...
Abstract: Rotation of vectors through fixed and known angles has wide applications in robotics, digi...