Variants for the Hough transform for line detection
Computational Geometry: Theory and Applications
Use of the Hough transformation to detect lines and curves in pictures
Communications of the ACM
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Do we need a stack to erase a component in a binary image?
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
| Hi-index | 0.00 |
This paper presents an algorithm for rotating a subimage in place without using any extra working array. Due to this constraint, we have to overwrite pixel values by interpolated values. Key ideas are local reliability test which determines whether interpolation at a pixel is carried out correctly without using interpolated values, and lazy interpolation which stores interpolated values in a region which is never used for output images and then fills in interpolated values after safety is guaranteed. It is shown that linear interpolation is always safely implemented. An extension to cubic interpolation is also discussed.