Computing visibility from folded surfaces

Abstract This paper presents an algorithm to estimate what parts of the surrounding environment are visible from each of many sample points on a surface, which may be highly folded and may contain holes. The results can be used to estimate how much of an extended light source is visible from each sample point and, thus, the shading of the surface. Examples are presented of shaded cloth. Unlike shading methods that use a local illumination model, the new method accurately estimates the darkness of deep folds in the cloth.

[1]  Robert E. Tarjan,et al.  An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..

[2]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[3]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[4]  A. James Stewart,et al.  Toward Accurate Recovery of Shape from Shading Under Diffuse Lighting , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Claude Puech,et al.  Radiosity and global illumination , 1994 .

[6]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[7]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[8]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[9]  Daniel Cohen-Or,et al.  Visibility and Dead‐Zones in Digital Terrain Maps , 1995, Comput. Graph. Forum.

[10]  Gregory J. Ward,et al.  The RADIANCE lighting simulation and rendering system , 1994, SIGGRAPH.

[11]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[12]  Michel Gangnet,et al.  Shaded Display of Digital Maps , 1984, IEEE Computer Graphics and Applications.

[13]  David W. Paglieroni.  The directional parameter plane transform of a height field , 1998, TOGS.

[14]  Robert L. Cook,et al.  Distributed ray tracing , 1984, SIGGRAPH.

[15]  Martin Held,et al.  Efficient and reliable triangulation of polygons , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[16]  A. James Stewart,et al.  Towards accurate recovery of shape from shading under diffuse lighting , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  A. James Stewart,et al.  Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications , 1998, IEEE Trans. Vis. Comput. Graph..

[18]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[19]  H. Tanaka,et al.  Three dimensional Terrain modeling and display for environmental assessment , 1989, SIGGRAPH.