Carregant...
Carregant...

Vés al contingut (premeu Retorn)

h-graphs : a new representation for tree decompositions of graphs

Autor
Hidalgo, M.; Joan-Arinyo, R.
Tipus d'activitat
Article en revista
Revista
Computer-Aided Design
Data de publicació
2015-10-01
Volum
67
Número
Issue C
Pàgina inicial
38
Pàgina final
47
DOI
https://doi.org/10.1016/j.cad.2015.05.003 Obrir en finestra nova
Projecte finançador
Simulación, modelado avanzado y análisis visual interactivo de grandes conjuntos de datos
Repositori
http://hdl.handle.net/2117/78683 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0010448515000688 Obrir en finestra nova
Resum
In geometric constraint solving, 2D well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination planner based solver. In general decomposition and recombination steps can be completed only when steps on which they are dependent have already been completed. This fact naturally defines a hierarchy in the decomposition-recombination steps that traditional tree decompos...
Citació
Hidalgo, M., Joan-Arinyo, R. h-graphs : a new representation for tree decompositions of graphs. "Computer Aided Design", 01 Octubre 2015, vol. 67, núm. Issue C, p. 38-47.
Paraules clau
CAD, Constraint graphs, Construction steps dependencies, GEOMETRIC CONSTRAINT SYSTEMS, Geometric constraint solving, PARAMETER RANGES, PLANS, Parameter ranges, Parametric solid modeling, Tree-decompositions
Grup de recerca
CREB - Centre de Recerca en Enginyeria Biomedica
GIE - Grup d'Informàtica a l'Enginyeria

Participants

Arxius