Show simple item record

dc.contributor.authorJoan Arinyo, Robert
dc.contributor.authorSoto Riera, Antoni
dc.contributor.authorTarres Puertas, Marta Isabel
dc.contributor.authorVila Marta, Sebastià
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-04-28T07:58:30Z
dc.date.available2016-04-28T07:58:30Z
dc.date.issued2007-09
dc.identifier.citationJoan-Arinyo, R., Soto-Riera, A., Tarrés, M., Vila-Marta, S. "Decomposition of geometric constraint graphs based on computing fundamental circuits". 2007.
dc.identifier.urihttp://hdl.handle.net/2117/86309
dc.description.abstractThe graph-based geometric constraint solving technique works in two steps. First the geometric problem is translated into a graph whose vertices represent de set of geometric elements and whose edges are the constraints. Then the constraint problem is solved by decomposing the graph into a colection of subgraphs each representing a standard problem which is solved by a dedicated equational solver. In this work we report on an algorithm to decompose biconnected graphs representing geometric constraint problems. The algorithm is based on recursively splitting the graphs through terns of vertices located on fundamental circuits of the graph. Preliminar experiments suggest that the algorithm runtime is at worst quadratic with the total number of vertices in the graph. In a case study we illustrate how the algorithm works.
dc.format.extent33 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-07-31-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherGeometric constraint solving
dc.subject.otherGraph decomposition
dc.titleDecomposition of geometric constraint graphs based on computing fundamental circuits
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1841061
dc.description.versionPostprint (published version)
local.citation.authorJoan-Arinyo, R.; Soto-Riera, A.; Tarrés, M.; Vila-Marta, S.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder