Computing vision points in polygons

DOI10.1007/PL00009271MaRDI QIDQ1293871zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 177562
• OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
• Computational complexity of art gallery problems

Cited in

(4)

• Mathematical Foundations of Computer Science 2004
• Polygon exploration with time-discrete vision
• \(k\)-Transmitter watchman routes
• GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293871)