Loading...
Loading...

Go to the content (press return)

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

Author
Hidalgo, M.; Joan-Arinyo, R.
Type of activity
Journal article
Journal
Computer-Aided Design
Date of publication
2015-10-01
Volume
67
Number
Issue C
First page
38
Last page
47
DOI
https://doi.org/10.1016/j.cad.2015.05.003 Open in new window
Project funding
Simulation, advanced modeling and interactive visual analysis of large data sets
Repository
http://hdl.handle.net/2117/78683 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0010448515000688 Open in new window
Abstract
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...
Citation
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.
Keywords
CAD, Constraint graphs, Construction steps dependencies, GEOMETRIC CONSTRAINT SYSTEMS, Geometric constraint solving, PARAMETER RANGES, PLANS, Parameter ranges, Parametric solid modeling, Tree-decompositions
Group of research
CREB - Biomedical Engineering Research Centre
GIE - Engineering Informatics Group

Participants

Attachments