Polygonal ribbons in two and three dimensions

Abstract A polygonal ribbon is a finite sequence of polygons (not necessarily coplanar) such that each pair of successive polygons intersect exactly in a common side. The study of such ribbons can be regarded as an initial step toward the study of polygonally approximated surfaces. In this paper we investigate various geometric and topological properties of polygonal ribbons in two and three dimensions, including properties such as nonselfintersection, orientability, and twist. When the polygons are all of simple types—for example, when they are all triangles or all rectangles—they can be represented compactly in terms of such quantities as vertex coordinates, side lengths and dihedral angles. For nonselfintersecting (NSI) ribbons, we establish basic connectivity properties of the ribbon and its border. Finally, we briefly treat the special case of planar ribbons.

[1]  Steven Skiena,et al.  Hamilton Triangulations for Fast Rendering , 1994, ESA.

[2]  Azriel Rosenfeld,et al.  Polygons in Three Dimensions , 1994, J. Vis. Commun. Image Represent..

[3]  Jan J. Koenderink,et al.  Solid shape , 1990 .

[4]  C. Hsiung A first course in differential geometry , 1981 .

[5]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  Takeo Kanade,et al.  A Theory of Origami World , 1979, Artif. Intell..

[8]  F. Crick Linking numbers and nucleosomes. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Jean Ponce,et al.  On characterizing ribbons and finding skewed symmetries , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[10]  Azriel Rosenfeld,et al.  Axial representations of shape , 1986, Computer Vision Graphics and Image Processing.