Sciweavers

13987 search results - page 5 / 2798
» The Two Guards Problem
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
IWOCA
2009
Springer
112views Algorithms» more  IWOCA 2009»
14 years 6 days ago
The Guarding Problem - Complexity and Approximation
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
POPL
1991
ACM
13 years 11 months ago
Coordinating First-Order Multiparty Interactions
-order multiparty interaction is an abstraction mechanism that defines communication among a set of formal process roles. Actual processes participate in a first-order interactio...
Yuh-Jzer Joung, Scott A. Smolka
CIAC
2003
Springer
110views Algorithms» more  CIAC 2003»
14 years 26 days 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...
JCSS
2008
107views more  JCSS 2008»
13 years 7 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens