140 search results - page 6 / 28 » Computing the visibility graph of points within a polygon |
VMV
2003
15 years 29 days ago
2003
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
VMV
2004
15 years 1 months ago
2004
In this paper, we present a novel, hardwareaccelerated approach to compute the visibility between surface points and directional light sources. Thus, our method provides a first-o...
CCCG
2010
15 years 1 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
105
click to vote
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
98
Voted
COMPGEOM
1998
ACM
15 years 3 months ago
1998
ACM
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...