Constraint-preserving labeled graph transformations for topology-based geometric modeling
| Autor: | Thomas Bellet, Agnès Arnould, Pascale Le Gall |
|---|---|
| Přispěvatelé: | Mathématiques et Informatique pour la Complexité et les Systèmes (MICS), CentraleSupélec, Synthèse et analyse d'images (XLIM-ASALI), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Université de Poitiers - Faculté de Sciences fondamentales et appliquées, Université de Poitiers, XLIM |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
static analysis algebraic data types [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE] DPO graph transformation graph transformation with variables generalized maps consistency preservation [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL] [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR] topology-based geometric modeling labeled graphs |
| Zdroj: | [Research Report] XLIM. 2017 HAL |
| Popis: | As labeled graphs are particularly well adapted to represent objects in the context of topology-based geometric modeling, graph transformation theory is an adequate framework to implement modeling operations and check their consistency. In this article, objects are defined as a particular subclass of labeled graphs in which arc labels encode their topological structure (i.e. cell subdivision: vertex, edge, face, etc.) and node labels encode their embedding (i.e. relevant data: vertex positions, face colors, volume density, etc.). Object consistency is therefore defined by labeling constraints which must be preserved along modeling operations that modify topology and/or embedding. In this article, we define a class of graph transformation rules dedicated to embedding computations. Dedicated graph transformation variables allow us to access the existing embedding from the underlying topological structure (e.g. collecting all the points of a face) in order to compute the new embedding using user-provided functions (e.g. compute the barycenter of several points). To ensure the safety of the defined operations, we provide syntactic conditions on rules that preserve the object consistency constraints. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|