A tight bound for point guards in piecewise convex art galleries
From MaRDI portal
Publication:2391541
DOI10.1016/J.COMGEO.2013.04.004zbMATH Open1278.65017OpenAlexW2096467882MaRDI QIDQ2391541FDOQ2391541
Authors: Javier Cano, Csaba D. Tóth, J. Urrutia 
Publication date: 31 July 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0925772113000370
Recommendations
Cites Work
- Title not available (Why is that?)
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- A combinatorial theorem in plane geometry
- Title not available (Why is that?)
- Triangulation and shape-complexity
- Decomposition and intersection of simple splinegons
- Computational geometry in a curved world
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- Computational complexity of art gallery problems
- Convex partitions with 2-edge connected dual graphs
- Hybrid shadow testing scheme for ray tracing
- A combinational approach to polygon similarity
- Guard placement for efficient point-in-polygon proofs
- Guarding curvilinear art galleries with vertex or point guards
Cited In (2)
This page was built for publication: A tight bound for point guards in piecewise convex art galleries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391541)
