Computing a maxian point of a simple rectilinear polygon (Q2643818): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2005.12.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2062617977
@@ Property / OpenAlex ID: W2062617977 / rank @@
+Normal rank
@@ Property / cites work @@
+On rectilinear link distance
@@ Property / cites work: On rectilinear link distance / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear decompositions with low stabbing number
+Normal rank
@@ Property / cites work @@
+Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
+Normal rank
@@ Property / cites work @@
+Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
+Normal rank
@@ Property / cites work @@
+Computing a median point of a simple rectilinear polygon
+Normal rank
@@ Property / cites work @@
+A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
+Normal rank