60 search results - page 6 / 12 » Query point visibility computation in polygons with holes |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
FCT
2003
Springer
14 years 23 days ago
2003
Springer
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...
VMV
2004
13 years 9 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...
IJRR
2008
13 years 7 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...