An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910): Difference between revisions

@@ Property / cites work @@
+Method of orienting curves for determining the convex hull of a finite set of points in the plane
+Normal rank
@@ Property / cites work @@
+The implementation of an algorithm to find the convex hull of a set of three-dimensional points
+Normal rank
@@ Property / cites work @@
+On the upper-bound conjecture for convex polytopes
+Normal rank
@@ Property / cites work @@
+Computational Geometry in C
@@ Property / cites work: Computational Geometry in C / rank @@
+Normal rank
@@ Property / cites work @@
+Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
+Normal rank
@@ Property / cites work @@
+Zur Lösung eines zermelosehen nayigationsproblems
+Normal rank
@@ Property / cites work @@
+Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
+Normal rank
@@ Property / cites work @@
+Method of orienting curves for solving optimal control problems with state constraints<sup>1</sup>
+Normal rank
@@ Property / cites work @@
+The method of orienting curves and its application to manipulator trajectory planning
+Normal rank
@@ Property / cites work @@
+Robust gift wrapping for the three-dimensional convex hull
+Normal rank