Declarative Mesh Subdivision Using Topological Rewriting in MGS

Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an imperative framework. The implementation is cumbersome and implies some tricky indices management. Smith et al. (2004) asks the question of the declarative programming of such algorithms in an index-free way. In this paper, we positively answer this question by presenting a rewriting framework where mesh refinements are described by simple rules. This framework is based on a notion of topological chain rewriting. Topological chains generalize the notion of labeled graph to higher dimensional objects. This framework has been implemented in the domain specific language MGS. The same generic approach has been used to implement Loop as well as Butterfly, Catmull-Clark and Kobbelt subdivision schemes.

[1]  Jean-Louis Giavitto,et al.  The Topological Structures of Membrane Computing , 2002, Fundam. Informaticae.

[2]  Hassan Charaf,et al.  Extending the DPO approach for topological validation of metamodel-level graph rewriting rules , 2005, ICSE 2005.

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

[4]  Pascale Le Gall,et al.  Graph Transformation for Topology Modelling , 2008, ICGT.

[5]  Colin Smith,et al.  Local Specification of Surface Subdivision Algorithms , 2003, AGTIVE.

[6]  Jean-Louis Giavitto,et al.  Transformation de collections topologiques de dimension arbitraire : application à la modélisation de systèmes dynamiques , 2006 .

[7]  Manfred Nagl,et al.  Applications of Graph Transformations with Industrial Relevance, Third International Symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers , 2008, Applications of Graph Transformations with Industrial Relevance.

[8]  Kenneth A. De Jong,et al.  Artificial Evolution , 2021, Lecture Notes in Computer Science.

[9]  Enzo Tonti.  On the Mathematical Structure of a Large Class of Physical Theories , 1971 .

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

[11]  Jean-Louis Giavitto,et al.  Algebraic Topology for Knowledge Representation in Analogy Solving , 1998, ECAI.

[12]  Josef Kittler,et al.  Applications of Graph Transformations with Industrial Relevance , 2011, Lecture Notes in Computer Science.

[13]  Jean-Louis Giavitto,et al.  Pattern-matching and rewriting rules for group indexed data structures , 2002, RULE '02.

[14]  Jean-Louis Giavitto,et al.  Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems , 2003, RTA.

[15]  Olivier Michel,et al.  Declarative modeling of a neurulation-like process , 2007, Biosyst..

[16]  Jean-Claude Raoult,et al.  Set-Theoretic Graph Rewriting , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[17]  Jean-Louis Giavitto,et al.  Algorithmic Self-assembly by Accretion and by Carving in MGS , 2005, Artificial Evolution.

[18]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[19]  Pierre Barbier de Reuille,et al.  Computer simulations reveal novel properties of the cell-cell signaling network at the shoot apex in /Arabidopsis , 2005 .

[20]  Jean-Louis Giavitto,et al.  Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems , 2008, Software-Intensive Systems and New Computing Paradigms.

[21]  Katsunori Shimohara,et al.  Graph Rewriting in Topology IV : Rewriting Based on Algebraic Operators (Algorithms in Algebraic Systems and Computation Theory) , 2002 .

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

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

[24]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .