Divide and Conquer Method for k-Set Polygons (Q5302751): Difference between revisions

@@ Property / cites work @@
+Q3024756
@@ Property / cites work: Q3024756 / rank @@
+Normal rank
@@ Property / cites work @@
+In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
+Normal rank
@@ Property / cites work @@
+On <i>k</i>-Hulls and Related Problems
@@ Property / cites work: On <i>k</i>-Hulls and Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for planar \(k\)-sets and related problems
+Normal rank
@@ Property / cites work @@
+k-Sets of Convex Inclusion Chains of Planar Point Sets
+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 @@
+Maintenance of configurations in the plane
@@ Property / cites work: Maintenance of configurations in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Point sets with many             <i>k</i>             -sets
@@ Property / cites work: Point sets with many <i>k</i> -sets / rank @@
+Normal rank