Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

DOI10.1007/BF01408289zbMath0783.68135OpenAlexW2013218978MaRDI QIDQ685228

Ivan Stojmenović, Dilip Sarkar

Publication date: 30 September 1993

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01408289

zbMATH Keywords

CREW PRAMdigital polygonspolygon separation

Mathematics Subject Classification ID

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

Related Items (2)

An elementary digital plane recognition algorithm ⋮ A fast and elementary algorithm for digital plane recognition

Cites Work

• Minimum polygonal separation
• Finding the convex hull of a sorted point set in parallel
• An optimal parallel circle-cover algorithm
• Optimal parallel generation of a computation tree form
• A taxonomy of problems with fast parallel algorithms
• Digital Convexity, Straightness, and Convex Polygons

This page was built for publication: Parallel algorithms for separation of two sets of points and recognition of digital convex polygons