Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
From MaRDI portal
Publication:1176071
DOI10.1007/BF02259747zbMath0738.68083OpenAlexW2020855733MaRDI QIDQ1176071
Viktor K. Prasanna, Hussein M. Alnuweiri
Publication date: 25 June 1992
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02259747
communication bandwidthlinear arrayscommunication diameterdata movement and partitioning techniquesdata reduction technique
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sorting in constant number of row and column phases on a mesh
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- An efficient algorithm for determining the convex hull of a finite planar set
- Information Transfer in Distributed Computing with Applications to VLSI
- Modular Matrix Multiplication on a Linear Array
- Data Movement Techniques for the Pyramid Computer
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- Optimal Sorting Algorithms for Parallel Computers