60 search results - page 1 / 12 » Query point visibility computation in polygons with holes |
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
CCCG
2010
13 years 6 months ago
2010
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
FAW
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
ISAAC
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon