A lower bound on the complexity of the convex hull problem for simple polyhedra (Q1107997): 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/0020-0190(87)90126-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2076987370
@@ Property / OpenAlex ID: W2076987370 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+Finding the convex hull of a simple polygon
@@ Property / cites work: Finding the convex hull of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+On finding the convex hull of a simple polygon
@@ Property / cites work: On finding the convex hull of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for finding the convex hull of a simple polygon
+Normal rank
@@ Property / cites work @@
+Convex hulls of finite sets of points in two and three dimensions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1107997