An efficient distributed thinning algorithm
From MaRDI portal
Recommendations
- A flexible thinning algorithm allowing parallel, sequential, and distributed application
- An asynchronous thinning algorithm
- Fast fully parallel thinning algorithms
- A parallel thinning algorithm with fine grain subtasking
- Distributed minimum cut approximation
- Optimization and performance analysis of thinning algorithms on parallel computers
- A noniterative thinning algorithm
- Parallel thinning algorithms on multicomputers: Experimental study on load balancing
- Almost-Tight Distributed Minimum Cut Algorithms
- Rapid randomized pruning for fast greedy distributed algorithms
Cited in
(6)- Design of a cellular architecture for fast computation of the skeleton
- Parallel thinning algorithms on multicomputers: Experimental study on load balancing
- Parallel skeletonizing of digital images by using cellular automata
- A noniterative thinning algorithm
- A flexible thinning algorithm allowing parallel, sequential, and distributed application
- Similarity of 2D thinning algorithms and their k-attempt versions
This page was built for publication: An efficient distributed thinning algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185918)