Declarative mesh subdivision using topological rewriting in MGS - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Declarative mesh subdivision using topological rewriting in MGS

Résumé

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.
Fichier principal
Vignette du fichier
spicher_michel_giavitto-icgt2010.pdf (240.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00820206 , version 1 (11-02-2014)

Identifiants

Citer

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⟩
112 Consultations
148 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More