Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.

Chuzo Iwamoto Tatsuaki Ibusuki

Published in: WALCOM (2020)

Keyphrases

art gallery
computational complexity
computational geometry
graph coloring
minimum length
color images
computationally efficient
special case
np complete
np hard
machine learning
decision problems
convex hull
computer graphics
job shop scheduling
simply connected