Optimal geometric algorithms on fixed-size linear arrays and scan line arrays
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 931-936
- https://doi.org/10.1109/cvpr.1988.196344
Abstract
Optimal parallel solutions are presented to several geometric problems on an n*n image on a fixed-size linear array with p processors, where 1<or=p<or=n. The array model considered here is an abstraction of several linearly connected parallel computers that have been constructed recently. The authors present O(n/sup 2//p) time solutions to several geometric problems which require global transfer of information such as labeling connected regions, computing the convexity and intersections of multiple regions, and computing several distance functions. All the solutions are optimal in the sense that their processor-time product is equal to the sequential complexity of the problems. Limitations of linear arrays in image computations are also discussed by showing that there are certain image problems which can be solved sequentially in O(n/sup 2/) time, but require Omega (n/sup 2/3) time on a linear array, irrespective of the number of processors used and the way in which the input image is partitioned among the processors. The authors also show alternate fixed-size array organizations with p processors which can solve the above problems in O(n/sup 2//p) time, for 1<or=p<or=n.Keywords
This publication has 16 references indexed in Scilit:
- Optimal geometric algorithms on fixed-size linear arrays and scan line arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An efficient VLSI architecture with applications to geometric problemsParallel Computing, 1989
- Sorting in constant number of row and column phases on a meshAlgorithmica, 1988
- Optimal Graph Algorithms on a Fixed-Size Linear ArrayIEEE Transactions on Computers, 1987
- P3E: New life for projection-based image processingJournal of Parallel and Distributed Computing, 1987
- Warp architecture and implementationACM SIGARCH Computer Architecture News, 1986
- Geometric Algorithms for Digitized Pictures on a Mesh-Connected ComputerIEEE Transactions on Pattern Analysis and Machine Intelligence, 1985
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerSIAM Journal on Computing, 1980