Mostra el registre d'ítem simple

dc.contributor.authorHidalgo Garcia, Marta
dc.contributor.authorJoan Arinyo, Robert
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2015-11-02T17:46:34Z
dc.date.available2017-10-03T00:30:27Z
dc.date.issued2015-10-01
dc.identifier.citationHidalgo, 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.
dc.identifier.issn0010-4485
dc.identifier.urihttp://hdl.handle.net/2117/78683
dc.description.abstractIn 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 decomposition representations do not capture explicitly.; In this work we introduce h-graphs, a new representation for decompositions of tree decomposable Laman graphs, which captures dependence relations between different tree decomposition steps. We show how h-graphs help in efficiently computing parameter ranges for which solution instances to well constrained, tree decomposable geometric constraint problems with one degree of freedom can actually be constructed. (C) 2015 Elsevier Ltd. All rights reserved.
dc.format.extent10 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshTrees (Graph Theory)
dc.subject.lcshComputational geometry
dc.subject.lcshConstraint programming (Computer science)
dc.subject.otherParametric solid modeling
dc.subject.otherGeometric constraint solving
dc.subject.otherConstraint graphs
dc.subject.otherTree-decompositions
dc.subject.otherConstruction steps dependencies
dc.subject.otherParameter ranges
dc.subject.otherGEOMETRIC CONSTRAINT SYSTEMS
dc.subject.otherPARAMETER RANGES
dc.subject.otherPLANS
dc.subject.otherCAD
dc.titleh-graphs : a new representation for tree decompositions of graphs
dc.typeArticle
dc.subject.lemacArbres (Grafs, Teoria de)
dc.subject.lemacGeometria computacional
dc.subject.lemacProgramació per restriccions (Informàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. GIE - Grup d'Informàtica a l'Enginyeria
dc.identifier.doi10.1016/j.cad.2015.05.003
dc.identifier.dlElse
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0010448515000688
dc.rights.accessOpen Access
local.identifier.drac16842487
dc.description.versionPostprint (published version)
local.citation.authorHidalgo, M.; Joan-Arinyo, R.
local.citation.publicationNameComputer Aided Design
local.citation.volume67
local.citation.numberIssue C
local.citation.startingPage38
local.citation.endingPage47


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple