Login / Signup

New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision.

Ovidiu DaescuHemant Malik
Published in: Theor. Comput. Sci. (2021)
Keyphrases
  • lower bound
  • upper bound
  • computer vision
  • three dimensional
  • vision system
  • np complete
  • problems involving
  • database
  • minimum length