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

DOI10.1007/BF01408289zbMATH Open0783.68135OpenAlexW2013218978MaRDI QIDQ685228FDOQ685228

Authors: Dilip Sarkar, Ivan Stojmenović 

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

Recommendations

• Minimum polygonal separation
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• scientific article; zbMATH DE number 4050997
• Parallel algorithms for some functions of two convex polygons
• Sequential and parallel algorithms for finding a maximum convex polygon

zbMATH Keywords

CREW PRAMdigital polygonspolygon separation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• A fast and elementary algorithm for digital plane recognition
• Minimum polygonal separation
• Title not available (Why is that?)
• A parallel algorithm for finding congruent regions
• An optimal algorithm for finding the separation of simple polygons
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• Parallel algorithms for some functions of two convex polygons
• Parallel algorithm for corner finding on digital curves
• An elementary digital plane recognition algorithm
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685228)