Computing vision points in polygons

DOI10.1007/PL00009271zbMath0928.68112OpenAlexW1966360761MaRDI QIDQ1293871

Svante Carlsson, Bengt J. Nilsson

Publication date: 29 June 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009271

zbMATH Keywords

straight walkable polygonsstreet polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

\(k\)-Transmitter watchman routes ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ Polygon exploration with time-discrete vision

This page was built for publication: Computing vision points in polygons