Computing a maxian point of a simple rectilinear polygon

Authors:
D. P. Wang
Affiliations:
Department of International Trade, National Pingtung Institute of Commerce, Pingtung, Taiwan, ROC
Venue:
Operations Research Letters
Year:
2007

Citing 10
Cited 0

Heuristics for minimum decompositions of polygons

Heuristics for minimum decompositions of polygons
Art gallery theorems and algorithms

Art gallery theorems and algorithms
On rectilinear link distance

Computational Geometry: Theory and Applications
Dynamic ray shooting and shortest paths via balanced geodesic triangulations

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing a median point of a simple rectilinear polygon

Information Processing Letters
Rectilinear decompositions with low stabbing number

Information Processing Letters
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

SIAM Journal on Computing
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks

Computers and Operations Research
Smallest paths in simple rectilinear polygons

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let P be a simple rectilinear polygon with n vertices. There are k points in P. The maxian problem is to locate a single facility in P so as to maximize the sum of its distance from it to the k points. We present an O((nxk)logn) time algorithm for this problem.