scientific article; zbMATH DE number 2009908

MaRDI QIDQ4434832zbMATH OpenFDO

Authors Ana Paula Tomás, Antonio L. Bajuelos, Fábio Sternieri Marques

Publication date 26 November 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2657/26570869.htm

Mathematics Subject Classification ID

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

Recommendations

• Guarding galleries and terrains
• Fast vertex guarding for polygons with and without holes
• On guarding the vertices of rectilinear domains
• Inapproximability results for guarding polygons and terrains
• Approximability of guarding weak visibility polygons

Cited in

(5)

• Inapproximability of finding maximum hidden sets on polygons and terrains
• Polynomial time approximation schemes for minimum disk cover problems
• scientific article; zbMATH DE number 2089209 (Why is no real title available?)
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• Approximating the minimum hub cover problem on planar graphs

This page was built for publication:

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