scientific article
From MaRDI portal
Publication:4037433
zbMath0764.68063MaRDI QIDQ4037433
Bengt J. Nilsson, Svante Carlsson, Simeon C. Ntafos
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardlinear time algorithmart gallery problemminimum number of vision pointsset of \(m\) watchmen in a histogramset of static guards in a histogram
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Online exploration outside a convex obstacle ⋮ Two-guarding a rectilinear polygon ⋮ Watchman routes in the presence of a pair of convex polygons
This page was built for publication:
