Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
type: Item
instance of: scholarly article
title: Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
zbMATH Open document ID: 0783.68135
DOI: 10.1007/BF01408289
author: Dilip Sarkar
author: Ivan Stojmenović
published in: International Journal of Parallel Programming
publication date: 1993-09-30T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 417141
zbMATH Keywords: digital polygons
zbMATH Keywords: polygon separation
zbMATH Keywords: CREW PRAM
MaRDI profile type: Publication
cites work: Minimum polygonal separation
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Optimal parallel generation of a computation tree form
cites work: Finding the convex hull of a sorted point set in parallel
cites work: An optimal parallel circle-cover algorithm
cites work: Digital Convexity, Straightness, and Convex Polygons
full work available at URL: https://doi.org/10.1007/bf01408289
OpenAlex ID: W2013218978
description: scientific article; zbMATH DE number 417141