Some aperture-angle optimization problems

DOI10.1007/S00453-001-0112-9zbMATH Open1041.68106OpenAlexW1999380033WikidataQ60020327 ScholiaQ60020327MaRDI QIDQ1849591FDOQ1849591

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

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

Recommendations

• Aperture-angle optimization problems in three dimensions
• Computing the extreme distances between two convex polygons
• scientific article; zbMATH DE number 177850
• Finding largest rectangles in convex polygons

zbMATH Keywords

AlgorithmsComputational geometryComplexityConvexityRoboticsDiscrete optimizationUnimodalityAperture angleVisibility.

Mathematics Subject Classification ID

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

Cited In (9)

• Aperture angle analysis for ellipsoids
• An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam
• Critical angles in random polyhedral cones
• A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule
• Lipschitz and Hölder continuity results for some functions of cones
• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• On finding widest empty curved corridors
• Aperture-angle optimization problems in three dimensions
• An illumination problem: optimal apex and optimal orientation for a cone of light

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

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