140 search results - page 2 / 28 » Computing the visibility graph of points within a polygon |
GD
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
AFRIGRAPH
2003
ACM
13 years 8 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
FAW
2009
Springer
13 years 8 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...
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
1990
ACM
13 years 9 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...