Some aperture-angle optimization problems

DOI10.1007/s00453-001-0112-9zbMath1041.68106OpenAlexW1999380033WikidataQ60020327 ScholiaQ60020327MaRDI QIDQ1849591

F. Hurtado-Diaz, Godfried T. Toussaint, Patrick Bosc, Jack Scott Snoeyink, Elsa Omaña-Pulido

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0112-9

zbMATH Keywords

AlgorithmsComputational geometryComplexityConvexityRoboticsDiscrete optimizationUnimodalityAperture angleVisibility.

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Natural language processing (68T50)

Related Items (7)

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 ⋮ Aperture-angle and Hausdorff-approximation of convex figures ⋮ 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

This page was built for publication: Some aperture-angle optimization problems