Relational Specification of Surface Subdivision Algorithms

Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. We address this discrepancy by defining a set of local operations on polygon meshes in relational, index-free terms. We also introduce the vv programming language to express these operations in a machine-readable form. We then apply vv to specify several surface subdivision algorithms. These specifications can be directly executed by the corresponding modeling software.

[1]  Ergun Akleman,et al.  Guaranteeing the 2-Manifold Property for Meshes with doubly Linked Face List , 1999, Int. J. Shape Model..

[2]  Colin Smith,et al.  L-System Description of Subdivision Curves , 2003, Int. J. Shape Model..

[3]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[4]  H. Ehlers.  LECTURERS , 1948, Statistics for Astrophysics.

[5]  Bruce G. Baumgart.  Winged edge polyhedron representation. , 1972 .

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

[7]  Charles T. Loop,et al.  Smooth Subdivision Surfaces Based on Triangles , 1987 .

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

[9]  Jean-Louis Giavitto,et al.  Declarative definition of group indexed data structures and approximation of their domains , 2001, PPDP '01.

[10]  Vadim Shapiro,et al.  Chain models of physical behavior for engineering analysis and design , 1993 .

[11]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[12]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[13]  Peter Schröder,et al.  Wavelets in computer graphics , 1996, Proc. IEEE.

[14]  A. White.  Graphs, Groups and Surfaces , 1973 .

[15]  Grzegorz Rozenberg,et al.  Parallel Generation of Maps: Developmental Systems for Cell Layers , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[16]  Luiz Velho,et al.  Stellar Subdivision Grammars , 2003, Symposium on Geometry Processing.

[17]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[18]  Pascal Lienhardt,et al.  Topological models for boundary representation: a comparison with n-dimensional generalized maps , 1991, Comput. Aided Des..

[19]  Aristid Lindenmayer,et al.  Mathematical Models for Cellular Interactions in Development , 1968 .

[20]  Pascal Lienhardt.  Subdivisions de surfaces et cartes généralisées de dimension 2 , 1991, RAIRO Theor. Informatics Appl..

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

[22]  Ergun Akleman,et al.  A Prototype System for Robust, Interactive and User-Friendly Modeling of Orientable 2-Manifold Meshes , 2002, Shape Modeling International.

[23]  W. B. R. Lickorish.  Simplicial moves on complexes and manifolds , 1999 .

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

[25]  Neil F. Stewart,et al.  A framework for system specification using chains on cell complexes , 1999, Comput. Aided Des..

[26]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[27]  N. Dyn,et al.  A butterfly subdivision scheme for surface interpolation with tension control , 1990, TOGS.

[28]  Ergun Akleman,et al.  A new paradigm for changing topology during subdivision modeling , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[29]  Leif Kobbelt,et al.  √3-subdivision , 2000, SIGGRAPH.