Computing an obnoxious anchored segment.

DOI10.1016/S0167-6377(03)00015-4MaRDI QIDQ1413920zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 17 November 2003

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(03)00015-4

zbMATH Keywords

Computational geometryLocationLine segmentOptimal algorithmMaximin

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80)

Recommendations

• 1-Segment Center Problems
• Maximizing the number of obnoxious facilities to locate within a bounded region
• Computing obnoxious 1-corner polygonal chains
• scientific article; zbMATH DE number 2111731
• An O\((n \log{}n)\) algorithm for a maxmin location problem

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• 1-Segment Center Problems
• An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
• Approximation of point sets by 1-corner polygonal chains
• Computing a Segment Center for a Planar Point Set
• Computing a largest empty anchored cylinder, and related problems
• Computing largest empty circles with location constraints
• Computing the width of a set
• Geometric complexity of some location problems
• The Largest Empty Annulus Problem

Cited in

(4)

• THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
• The maximin HAZMAT routing problem
• 1-Segment Center Problems
• Computing obnoxious 1-corner polygonal chains

This page was built for publication: Computing an obnoxious anchored segment.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413920)