SEARCHING POLYHEDRA BY ROTATING HALF-PLANES

DOI10.1142/S0218195912500070zbMath1272.68419OpenAlexW2963932815MaRDI QIDQ5300000

Giovanni Viglietta

Publication date: 24 June 2013

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195912500070

zbMATH Keywords

polyhedrasearchlight schedulingfilling guardsearchplane

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ Face-guarding polyhedra ⋮ Reprint of: Face-guarding polyhedra ⋮ The searchlight problem for road networks

Cites Work

• Searching a polygonal region by a group of stationary \(k\)-searchers
• Triangulating a nonconvex polytope
• A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• The Searchlight Scheduling Problem
• Computational complexity of art gallery problems

This page was built for publication: SEARCHING POLYHEDRA BY ROTATING HALF-PLANES