A note on finding convex hulls via maximal vectors (Q1144946): Difference between revisions

@@ Property / cites work @@
+Divide and conquer for linear expected time
@@ Property / cites work: Divide and conquer for linear expected time / rank @@
+Normal rank
@@ Property / cites work @@
+On the Average Number of Maxima in a Set of Vectors and Applications
+Normal rank
@@ Property / cites work @@
+A note on linear expected time algorithms for finding convex hulls
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+On the identification of the convex hull of a finite set of points in the plane
+Normal rank
@@ Property / cites work @@
+Convex hulls of finite sets of points in two and three dimensions
+Normal rank
@@ Property / cites work @@
+Sur L'enveloppe convexe des nuages de points aleatoires dans <i>R<sup>n</sup></i>. I
+Normal rank
@@ Property / cites work @@
+ZufÄllige konvexe Polygone in einem Ringgebiet
@@ Property / cites work: ZufÄllige konvexe Polygone in einem Ringgebiet / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133127
@@ Property / cites work: Q4133127 / rank @@
+Normal rank