dc.contributor.author Joan Arinyo, Robert dc.contributor.author Soto Riera, Antoni dc.contributor.author Tarres Puertas, Marta Isabel dc.contributor.author Vila Marta, Sebastià dc.contributor.other Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics dc.date.accessioned 2016-04-28T07:58:30Z dc.date.available 2016-04-28T07:58:30Z dc.date.issued 2007-09 dc.identifier.citation Joan-Arinyo, R., Soto-Riera, A., Tarrés, M., Vila-Marta, S. "Decomposition of geometric constraint graphs based on computing fundamental circuits". 2007. dc.identifier.uri http://hdl.handle.net/2117/86309 dc.description.abstract The 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.extent 33 p. dc.language.iso eng dc.relation.ispartofseries LSI-07-31-R dc.subject Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica dc.subject.other Geometric constraint solving dc.subject.other Graph decomposition dc.title Decomposition of geometric constraint graphs based on computing fundamental circuits dc.type External research report dc.rights.access Open Access local.identifier.drac 1841061 dc.description.version Postprint (published version) local.citation.author Joan-Arinyo, R.; Soto-Riera, A.; Tarrés, M.; Vila-Marta, S.
﻿