Sequential and parallel algorithms for finding a maximum convex polygon (Q676573): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0925-7721(95)00035-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2080255048
@@ Property / OpenAlex ID: W2080255048 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Largest Empty Rectangle
@@ Property / cites work: Computing the Largest Empty Rectangle / rank @@
+Normal rank
@@ Property / cites work @@
+A Functional Approach to Data Structures and Its Use in Multidimensional Searching
+Normal rank
@@ Property / cites work @@
+Q3928584
@@ Property / cites work: Q3928584 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum area \(k\)-gons
@@ Property / cites work: Finding minimum area \(k\)-gons / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum polygonal separation
@@ Property / cites work: Minimum polygonal separation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284244
@@ Property / cites work: Q4284244 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank