Computing an obnoxious anchored segment

Authors:
J. A. Barcia;J. M. DıAz-BáñEz;A. J. Lozano;I. Ventura
Affiliations:
Departamento de Matemática Aplicada II, Universidad de Sevilla, Spain;Departamento de Matemática Aplicada II, Universidad de Sevilla, Spain;Departamento de Matemáticas, Universidad de Huelva, Spain;Departamento de Matemáticas, Universidad de Huelva, Spain
Venue:
Operations Research Letters
Year:
2003

Citing 5
Cited 2

Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing a segment center for a planar point set

Journal of Algorithms
The Largest Empty Annulus Problem

ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Approximation of Point Sets by 1-Corner Polygonal Chains

INFORMS Journal on Computing
An O(mn2) algorithm for the Maximin problem in E2

Operations Research Letters

Computing obnoxious 1-corner polygonal chains

Computers and Operations Research
Computing obnoxious 1-corner polygonal chains

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address a maximin facility location problem for n points in the plane such that the facility is an anchored line segment of a fixed length. We show how to solve this problem in O(nlogn) time, which is optimal in the algebraic computation tree model. Other variations of this problem are also discussed.