Computation of geometric properties from the medial axis transform in O (n log n) time
Computer Vision, Graphics, and Image Processing
Optimal algorithms for rectangle problems on a mesh-connected computer
Journal of Parallel and Distributed Computing
A bridging model for parallel computation
Communications of the ACM
Serial and Parallel Algorithms for the Medial Axis Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance
Journal of the ACM (JACM)
Computer representation of planar regions by their skeletons
Communications of the ACM
Digital Picture Processing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Parallel complexity of the medial axis computation
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
DBSC-based pencil style simulation for line drawings
Proceedings of the 2006 international conference on Game research and development
3D block-based medial axis transform and chessboard distance transform based on dominance
Image and Vision Computing
Hi-index | 0.14 |
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 implementations for the distance-based and the block-based medial axis transform in a wide variety of parallel architectures. Since only eight scan operations plus a dozen local operations are performed, the algorithm is very easy to program and use. The originality of our approach is the use of the notion of a derived grid and the oversampling of the image in order to reduce the computation of the block-based medial axis transform in the original grid to the much easier task of computing the distance based medial axis transform of the oversampling of the image on the derived grid.