Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
DOI10.1016/j.comgeo.2010.07.002zbMath1202.65028OpenAlexW3102089790MaRDI QIDQ709066
Publication date: 15 October 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.07.002
triangulation graph2-dominance edge guardscurvilinear art galleriesmobile guardspiecewise-convex polygons
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Combinatorial complexity of geometric structures (52C45)
Related Items (4)
Cites Work
- Unnamed Item
- Effective computational geometry for curves and surfaces
- Computational geometry in a curved world
- Guarding curvilinear art galleries with vertex or point guards
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- An algorithmic approach to some problems in terrain navigation
- A short proof of Chvatal's Watchman Theorem
- Edge guards in rectilinear polygons
- Protecting convex sets
- A combinatorial theorem in plane geometry
- Hybrid shadow testing scheme for ray tracing
- Illuminating high-dimensional convex sets
- Generalized guarding and partitioning for rectilinear polygons
- Guard placement for efficient point-in-polygon proofs
- Triangulation and shape-complexity
- Computational complexity of art gallery problems
- A combinational approach to polygon similarity
This page was built for publication: Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
