Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays

DOI10.1007/BF01759068zbMath0736.68081OpenAlexW2020133807MaRDI QIDQ1175647

Hussein M. Alnuweiri, V. K. Prasanna Kumar

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01759068

zbMATH Keywords

digitized image problemsmesh arraysprocessor-time tradeoffs

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Related Items (1)

Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in constant number of row and column phases on a mesh
• Parallel computational geometry
• An efficient algorithm for determining the convex hull of a finite planar set
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• Data Movement Techniques for the Pyramid Computer
• An orthogonal multiprocessor for parallel scientific computations
• Parallel sorting in two-dimensional VLSI models of computation
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• An O(logn) parallel connectivity algorithm
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Convex hulls of finite sets of points in two and three dimensions
• Hypercube and shuffle-exchange algorithms for image component labeling
• Optimal VLSI sorting with reduced number of processors
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays