L-System Description of Subdivision Curves

In recent years, subdivision has emerged as a major geometric modeling technique. Algorithms for generating subdivision curves are often specified in terms of iterated matrix multiplication. Each multiplication maps a globally indexed sequence of points that represents a coarser approximation of the curve onto a longer sequence that represents a finer approximation. Unfortunately, this use of matrices and indices obscure the local and stationary character of typical subdivision rules. We introduce parametric context-sensitive L-systems with affine geometry interpretation as an alternative technique for specifying and generating subdivision curves. This technique is illustrated using Chaikin, cubic B-spline, and Dyn-Levin-Gregory (4-point) subdivision schemes as examples. L-systems formalize subdivision algorithms in an intuitive, concise, index-free manner, reflecting the parallel and local character of these algorithms. Furthermore, L-system specification of subdivision algorithms directly leads to their computer implementation.

[1]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[2]  Radomír Mech,et al.  An L-System-Based Plant Modeling Language , 1999, AGTIVE.

[3]  J. Warren,et al.  Subdivision methods for geometric design , 1995 .

[4]  Jean-Louis Giavitto,et al.  Transformations of Topological Collections , 2001 .

[5]  Jules Bloomenthal,et al.  Skeletal design of natural forms , 1996 .

[6]  P. Gerdes.  Reconstruction and extension of lost symmetries: Examples from the Tamil of South India , 1989 .

[7]  A. Lindenmayer.  Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.

[8]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[9]  Malcolm Sabin,et al.  Subdivision Surfaces , 2002, Handbook of Computer Aided Geometric Design.

[10]  David Salesin,et al.  Wavelets for computer graphics: theory and applications , 1996 .

[11]  Melvin Hausner,et al.  A Vector Space Approach to Geometry , 1967 .

[12]  H. Jürgensen,et al.  Parameterized L Systems for Modelling: Potential and Limitations , 1992 .

[13]  R. W. Baker,et al.  Simulation of organisms using a developmental model. 1. Basic description. , 1972, International journal of bio-medical computing.

[14]  Przemyslaw Prusinkiewicz,et al.  Improving the process of plant modeling: the l+c modeling language , 2003 .

[15]  Radomír Mech,et al.  Visual Models of Plant Development , 1997, Handbook of Formal Languages.

[16]  Gift Siromoney,et al.  A Perspective in Theoretical Computer Science - Commemorative Volume for Gift Siromoney , 1989, A Perspective in Theoretical Computer Science.

[17]  Ron Goldman.  On the algebraic and geometric foundations of computer graphics , 2002, TOGS.

[18]  Aristid Lindenmayer,et al.  Adding Continuous Components to L-Systems , 1974, L Systems.

[19]  Przemyslaw Prusinkiewicz,et al.  Graphical applications of L-systems , 1986 .

[20]  M. Sabin,et al.  Behaviour of recursive division surfaces near extraordinary points , 1978 .

[21]  R. Bartels,et al.  Reversing subdivision rules: local linear conditions and observations on inner products , 2000 .

[22]  A. Lindenmayer.  Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.

[23]  Manfred Nagl,et al.  Applications of Graph Transformations with Industrial Relevance , 2003, Lecture Notes in Computer Science.

[24]  A. Lindenmayer.  Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs. , 1968, Journal of theoretical biology.

[25]  Gerald Farin,et al.  Curves and surfaces for cagd , 1992 .

[26]  Rani Siromoney,et al.  Kahbi Kolam and Cycle Grammars , 1989, A Perspective in Theoretical Computer Science.

[27]  Tony DeRose,et al.  Subdivision surfaces in character animation , 1998, SIGGRAPH.

[28]  T. DeRose,et al.  A coordinate-free approach to geometric programming , 1989 .

[29]  Gabor T. Herman,et al.  Simulation of organisms using a developmental model part 1: Basic description , 1972 .

[30]  Przemyslaw Prusinkiewicz,et al.  Application of L-Systems to Algorithmic Generation of South Indian Folk Art Patterns and Karnatic Music , 1989, A Perspective in Theoretical Computer Science.

[31]  Nira Dyn,et al.  A 4-point interpolatory subdivision scheme for curve design , 1987, Comput. Aided Geom. Des..

[32]  Azriel Rosenfeld,et al.  A Note on Cycle Grammars , 1975, Inf. Control..

[33]  Przemyslaw Prusinkiewicz,et al.  Lindenmayer Systems, Fractals, and Plants , 1989, Lecture Notes in Biomathematics.

[34]  Przemyslaw Prusinkiewicz,et al.  Parametric l-systems and their application to the modelling and visualization of plants , 1992 .

[35]  Tony Derose,et al.  Three-dimensional computer graphics. , 1987 .

[36]  George Merrill Chaikin,et al.  An algorithm for high-speed curve generation , 1974, Comput. Graph. Image Process..

[37]  Richard H. Bartels,et al.  Multiresolution Curve and Surface Representation: Reversing Subdivision Rules by Least‐Squares Data Fitting , 1999, Comput. Graph. Forum.

[38]  G. Farin.  Curves and Surfaces for Cagd: A Practical Guide , 2001 .