Serial and Parallel Algorithms for the Medial Axis Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing the Medial Axis Transform in Parallel With Eight Scan Operations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constructing H4, a Fast Depth-Size Optimal Parallel Prefix Circuit
The Journal of Supercomputing
Z4: a new depth-size optimal parallel prefix circuit with small depth
Neural, Parallel & Scientific Computations
A new approach to constructing optimal parallel prefix circuits with small depth
Journal of Parallel and Distributed Computing
Faster optimal parallel prefix circuits: New algorithmic construction
Journal of Parallel and Distributed Computing
Computation-efficient parallel prefix
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Two families of parallel prefix algorithms for multicomputers
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Parallel prefix algorithms on the multicomputer
WSEAS Transactions on Computer Research
New parallel prefix algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
New families of computation-efficient parallel prefix algorithms
WSEAS Transactions on Computers
| Hi-index | 0.00 |
The main result of this paper shows that the block-based digital medial axis transform can be computed in parallel by a constant number of calls to scan (parallel prefix) operations. This gives time- and/or work-optimal parallel algorithms for the distance-based and the block-based medial axis transform in a wide variety of parallel architectures. In order to design such an algorithm, we first demonstrate that computing a block-based medial axis transform of a binary image reduces to computing the distance based medial axis transform of an oversampling of the image, by proving that their labelings are equivalent.