A tight bound for point guards in piecewise convex art galleries
From MaRDI portal
Publication:2391541
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- A combinational approach to polygon similarity
- A combinatorial theorem in plane geometry
- Computational complexity of art gallery problems
- Computational geometry in a curved world
- Convex partitions with 2-edge connected dual graphs
- Decomposition and intersection of simple splinegons
- Guard placement for efficient point-in-polygon proofs
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- Guarding curvilinear art galleries with vertex or point guards
- Hybrid shadow testing scheme for ray tracing
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- Triangulation and shape-complexity
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)