Computing an obnoxious anchored segment.

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

D. Massart

Publication date: 17 November 2003

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

zbMATH Keywords

Computational geometry; Location; Line segment; Optimal algorithm; Maximin

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

90B80: Discrete location and assignment