Triangulating and guarding realistic polygons

DOI10.1016/J.COMGEO.2013.03.005zbMATH Open1314.65028OpenAlexW2086607663WikidataQ59782262 ScholiaQ59782262MaRDI QIDQ390140FDOQ390140

Authors: Greg Aloupis, Prosenjit Bose, Vida Dujmović, Chris Gray, Stefan Langerman, Bettina Speckmann 

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.03.005

Recommendations

• Guarding scenes against invasive hypercubes.
• \(K\)-vertex guarding simple polygons
• Generalized guarding and partitioning for rectilinear polygons
• Note on the paper ``K-vertex guarding simple polygons
• Approximate guarding of monotone and rectilinear polygons

zbMATH Keywords

triangulationguardingart gallerypolygongeometric algorithmvisibility-polygon computation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (5)

• Guarding disjoint triangles and claws in the plane
• Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
• Guarding scenes against invasive hypercubes.
• A note on the perimeter of fat objects
• On \(k\)-convex polygons

This page was built for publication: Triangulating and guarding realistic polygons

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