Connected components in binary images: the detection problem
Connected components in binary images: the detection problem
Upper bounds for time-space trade-offs in sorting and selection
Journal of Computer and System Sciences
Euclidean distance transformations amd model-guided image interpretation
Pattern Recognition Letters
Stable linear time sublinear space merging
The Computer Journal
Unstable linear time (1) space merging
The Computer Journal
Distance transforms: properties and machine vision applications
CVGIP: Graphical Models and Image Processing
A unified linear-time algorithm for computing distance maps
Information Processing Letters
Selection from read-only memory and sorting with minimum data movement
Theoretical Computer Science
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Asymptotically efficient in-place merging
Theoretical Computer Science
Theoretical Computer Science
Digital Picture Processing
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nordic Journal of Computing
Improved upper bounds for time-space trade-offs for selection
Nordic Journal of Computing
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
A linear-time component-labeling algorithm using contour tracing technique
Computer Vision and Image Understanding
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Space-Efficient Algorithm for Image Rotation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
In-place algorithm for image rotation
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
In-place linear-time algorithms for Euclidean distance transform
Transactions on computational science VIII
In-place linear-time algorithms for Euclidean distance transform
Transactions on computational science VIII
Constant-Work-Space algorithm for a shortest path in a simple polygon
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.00 |
This chapter surveys recent progress in constant-working-space algorithms for problems related to image processing. An extreme case is when an input image is given as read-only memory in which reading an array element is allowed but writing any value at any array element is prohibited, and also the number of working storage cells available for algorithms is at most some constant. This chapter shows how a number of important fundamental problems can be solved in such a highly constrained situation.