Packing two disks into a polygonal environment. (Q878013): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2003.12.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1989681946
@@ Property / OpenAlex ID: W1989681946 / rank @@
+Normal rank
@@ Property / cites work @@
+Farthest neighbors, maximum spanning trees and related problems in higher dimensions
+Normal rank
@@ Property / cites work @@
+OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
+Normal rank
@@ Property / cites work @@
+Packing two disks in a polygon
@@ Property / cites work: Packing two disks in a polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Q2728847
@@ Property / cites work: Q2728847 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the medial axis of a simple polygon in linear time
+Normal rank
@@ Property / cites work @@
+Improved algorithms for placing undesirable facilities
+Normal rank
@@ Property / cites work @@
+Placing two disks in a convex polygon
@@ Property / cites work: Placing two disks in a convex polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Applying Parallel Computation Algorithms in the Design of Serial Algorithms
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank