On some geometric problems of color-spanning sets (Q2392733): Difference between revisions

@@ Property / cites work @@
+Q4796181
@@ Property / cites work: Q4796181 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230329
@@ Property / cites work: Q4230329 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+SMALLEST COLOR-SPANNING OBJECT REVISITED
@@ Property / cites work: SMALLEST COLOR-SPANNING OBJECT REVISITED / rank @@
+Normal rank
@@ Property / cites work @@
+Average case analysis of dynamic geometric optimization
+Normal rank
@@ Property / cites work @@
+Computing Minimum Diameter Color-Spanning Sets
@@ Property / cites work: Computing Minimum Diameter Color-Spanning Sets / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+Q4547814
@@ Property / cites work: Q4547814 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank