13 search results - page 1 / 3 » Visibility Queries in Simple Polygons and Applications |
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
DCG
2002
13 years 5 months ago
2002
SIGGRAPH
1997
ACM
13 years 8 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
COMPGEOM
1993
ACM
13 years 9 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
COMPGEOM
2005
ACM
13 years 7 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...