Finding a minimal cover for binary images: An optimal parallel algorithm
From MaRDI portal
Publication:1175643
DOI10.1007/BF01759065zbMATH Open0737.68091MaRDI QIDQ1175643FDOQ1175643
Authors: Dipen Moitra 
Publication date: 25 June 1992
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
- A new algorithmic framework for basic problems on binary images
- Morphological decomposition and compression of binary images via a minimum set cover algorithm
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
- An optimal parallel algorithm for the minimum circle-cover problem
- scientific article; zbMATH DE number 1304054
- A parallel circle-cover minimization algorithm
- Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images
- Approximation schemes for covering and packing problems in image processing and VLSI
- Parallel algorithms for determining \(k\)-width connectivity in binary images
bipartite graphsimage compressionorthogonal polygonsEREW-PRAMminimal vertex coversminimum square coverparallel prefix computations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Distributed algorithms (68W15)
Cites Work
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Parallel Prefix Computation
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Faster optimal parallel prefix sums and list ranking
- Covering Polygons Is Hard
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Minimal rectangular partitions of digitized blobs
Cited In (5)
- Approximation algorithms for decomposing octilinear polygons
- Title not available (Why is that?)
- Medial axis transform on mesh-connected computers with hyperbus broadcasting
- Morphological decomposition and compression of binary images via a minimum set cover algorithm
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
This page was built for publication: Finding a minimal cover for binary images: An optimal parallel algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175643)
