Topological matching

Authors:
Quentin F. Stout
Affiliations:
-
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 3
Cited 5

Sorting on a mesh-connected parallel computer

Communications of the ACM
On shrinking binary picture patterns

Communications of the ACM
Fast parallel processing array algorithms for some graph problems(Preliminary Version)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Mesh Computer Algorithms for Computational Geometry

IEEE Transactions on Computers
A Classical Construction for the Digital Fundamental Group

Journal of Mathematical Imaging and Vision
Properties of Digital Homotopy

Journal of Mathematical Imaging and Vision
Digital Products, Wedges, and Covering Spaces

Journal of Mathematical Imaging and Vision
The Classification of Digital Covering Spaces

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is a lot of practical and theoretical interest in designing algorithms to process digital pictures. Of particular interest are problems arising when one starts with an nxn array of pixels and stores it, one pixel per processor, in some sort of array-like parallel computer. In this paper we give an optimal &thgr;(n) time solution, based on a simpler &thgr;(n) time solution for a more powerful computer called a mesh computer. Beyer suggested that this problem was a prime candidate for a non-linear recognition problem, but our result shows that this is not true.