COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242): Difference between revisions

@@ Property / cites work @@
+Optimal parallel algorithms for point-set and polygon problems
+Normal rank
@@ Property / cites work @@
+On a circle placement problem
@@ Property / cites work: On a circle placement problem / rank @@
+Normal rank
@@ Property / cites work @@
+Arrangements of curves in the plane --- topology, combinatorics, and algorithms
+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 @@
+Finding tailored partitions
@@ Property / cites work: Finding tailored partitions / rank @@
+Normal rank
@@ Property / cites work @@
+An Expander-Based Approach to Geometric Optimization
+Normal rank
@@ Property / cites work @@
+Geometric complexity of some location problems
@@ Property / cites work: Geometric complexity of some location problems / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+A near-linear algorithm for the planar 2-center problem
+Normal rank