Sciweavers

4 search results - page 1 / 1
» Maximizing the Guarded Boundary of an Art Gallery Is APX-Com...
Sort
View
CIAC
2003
Springer
110views Algorithms» more  CIAC 2003»
13 years 10 months ago
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
Euripides Markou, Stathis Zachos, Christodoulos Fr...
CCCG
2009
13 years 3 months ago
Wireless Localization with Vertex Guards is NP-hard
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
Tobias Christ, Michael Hoffmann
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
13 years 9 months ago
New Results on Visibility in Simple Polygons
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...
Alexander Gilbers, Rolf Klein
FCT
2003
Springer
13 years 10 months ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun