Aperture-angle optimization problems in three dimensions

DOI10.1023/A:1021666512528zbMath1064.90037OpenAlexW1549928317MaRDI QIDQ1868505

Godfried T. Toussaint, Elsa Omaña-Pulido

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021666512528

zbMATH Keywords

geometryalgorithmsconvexityaperture-anglecomputational-complexitydiscrete-optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)

Related Items

An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam ⋮ Critical angles in random polyhedral cones ⋮ ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS ⋮ An illumination problem: optimal apex and optimal orientation for a cone of light ⋮ Lipschitz and Hölder continuity results for some functions of cones ⋮ A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule