Declarative mesh subdivision using topological rewriting in MGS

Antoine Spicher 1 Olivier Michel 1 Jean-Louis Giavitto 2
2 COSMO
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00820206
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, February 11, 2014 - 3:08:17 PM
Last modification on : Sunday, February 24, 2019 - 6:00:02 PM
Document(s) archivé(s) le : Monday, May 12, 2014 - 11:21:37 AM

File

spicher_michel_giavitto-icgt20...
Files produced by the author(s)

Identifiers

Collections

Citation

Antoine Spicher, Olivier Michel, Jean-Louis Giavitto. Declarative mesh subdivision using topological rewriting in MGS. 5th International Conference on Graph Transformations (ICGT 2010), Sep 2010, Enschede, Netherlands. pp.298--313, ⟨10.1007/978-3-642-15928-2_20⟩. ⟨hal-00820206⟩

Share

Metrics

Record views

191

Files downloads

106