Buscar
Mostrando ítems 1-7 de 7
Computing coverage kernels under restricted settings
(Elsevier, 2020)
Given a set B of d-dimensional boxes (i.e., axis-aligned hyperrectangles), a minimum coverage kernel is a subset of B of minimum size covering the same region as B. Computing it is NP-hard, but as for many similar NP-hard ...
An exact algorithm for minimizing vertex guards on art galleries
(Wiley-blackwellMaldenEUA, 2011)
Cobertura em ambientes 3D arbitrários: o problema da galeria de arte em jogos de tiro
(Universidade Federal de Minas GeraisUFMG, 2014-01-20)
The Art Gallery Problem consists in determining the minimum number of observers required to cover an environment such that each point of space is seen by at least one observer. This is a NP-Hard problem well known in the ...