Finding a minimal cover for binary images: An optimal parallel algorithm

DOI10.1007/BF01759065zbMath0737.68091MaRDI QIDQ1175643

Dipen Moitra

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

image compressionbipartite graphsorthogonal polygonsEREW-PRAMminimal vertex coversminimum square coverparallel prefix computations

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items

Medial axis transform on mesh-connected computers with hyperbus broadcasting ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM

Cites Work

• Faster optimal parallel prefix sums and list ranking
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Minimal rectangular partitions of digitized blobs
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Parallel Prefix Computation
• Covering Polygons Is Hard
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph