Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum polygonal separation
@@ Property / cites work: Minimum polygonal separation / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Optimal parallel generation of a computation tree form
+Normal rank
@@ Property / cites work @@
+Finding the convex hull of a sorted point set in parallel
+Normal rank
@@ Property / cites work @@
+An optimal parallel circle-cover algorithm
@@ Property / cites work: An optimal parallel circle-cover algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Digital Convexity, Straightness, and Convex Polygons
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01408289
+Normal rank
@@ Property / OpenAlex ID @@
+W2013218978
@@ Property / OpenAlex ID: W2013218978 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:685228