Computing an obnoxious anchored segment.

DOI10.1016/S0167-6377(03)00015-4zbMath1041.90022OpenAlexW1994404645MaRDI QIDQ1413920

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)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric complexity of some location problems
• An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
• Approximation of Point Sets by 1-Corner Polygonal Chains
• Computing a largest empty anchored cylinder, and related problems
• Computing largest empty circles with location constraints
• Computing a Segment Center for a Planar Point Set
• Computing the width of a set
• 1-Segment Center Problems
• The Largest Empty Annulus Problem

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