43 search results - page 1 / 9 » New Results on Visibility in Simple Polygons |
WADS
2009
Springer
13 years 10 months ago
2009
Springer
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...
SIGGRAPH
1997
ACM
13 years 9 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
1999
ACM
13 years 9 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
COMPGEOM
2004
ACM
13 years 11 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...
AFRIGRAPH
2003
ACM
13 years 9 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...