Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Pattern-matching and rewriting rules for group indexed data structures
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
The topological structures of membrane computing
Fundamenta Informaticae - Membrane computing
Extending the DPO approach for topological validation of metamodel-level graph rewriting rules
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Graph Transformation for Topology Modelling
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems
Software-Intensive Systems and New Computing Paradigms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Algorithmic self-assembly by accretion and by carving in MGS
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Building topological spaces for musical objects
MCM'11 Proceedings of the Third international conference on Mathematics and computation in music
Integrated regulatory networks (IRNs): Spatially organized biochemical modules
Theoretical Computer Science
The modeling and the simulation of the fluid machines of synthetic biology
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Interaction based simulation of dynamical system with a dynamical structure (DS)2 in MGS
Proceedings of the 2011 Summer Computer Simulation Conference
A Graph Grammar Model of the hp Adaptive Three Dimensional Finite Element Method. Part I
Fundamenta Informaticae
Topological computation of activity regions
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
A review of morphogenetic engineering
Natural Computing: an international journal
| Hi-index | 0.00 |
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.