A tight bound for point guards in piecewise convex art galleries
From MaRDI portal
Publication:2391541
DOI10.1016/j.comgeo.2013.04.004zbMath1278.65017MaRDI QIDQ2391541
Jorge Urrutia, Javier Cano, Csaba D. Tóth
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
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Convex partitions with 2-edge connected dual graphs
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- Computational geometry in a curved world
- Guarding curvilinear art galleries with vertex or point guards
- Decomposition and intersection of simple splinegons
- A combinatorial theorem in plane geometry
- Hybrid shadow testing scheme for ray tracing
- Guard placement for efficient point-in-polygon proofs
- Triangulation and shape-complexity
- Computational complexity of art gallery problems
- A combinational approach to polygon similarity
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions