dc.contributor.author Joan Arinyo, Robert dc.contributor.author Tarres Puertas, Marta Isabel dc.contributor.author Vila Marta, Sebastià dc.contributor.other Universitat Politècnica de Catalunya. Departament de Ciències de la Computació dc.contributor.other Universitat Politècnica de Catalunya. Departament de Disseny i Programació de Sistemes Electrònics dc.date.accessioned 2014-11-10T10:06:18Z dc.date.created 2014-07-01 dc.date.issued 2014-07-01 dc.identifier.citation Joan-Arinyo, R.; Tarres, M.; Vila, S. Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity. "Computer Aided Design", 01 Juliol 2014, vol. 52, p. 1-16. dc.identifier.issn 0010-4485 dc.identifier.uri http://hdl.handle.net/2117/24627 dc.description.abstract In geometric constraint solving, Decomposition Recombination solvers (DR-solvers) refer to a general solving approach where the problem is divided into a set of sub-problems, each sub-problem is recursively divided until reaching basic problems which are solved by a dedicated equational solver. Then the solution to the starting problem is computed by merging the solutions to the sub-problems.; Triangle- or tree-decomposition is one of the most widely used approaches in the decomposition step in DR-solvers. It may be seen as decomposing a graph into three subgraphs such that subgraphs pairwise share one graph vertex. Shared vertices are called hinges. Then a merging step places the geometry in each sub-problem with respect to the other two.; In this work we report on a new algorithm to decompose biconnected geometric constraint graphs by searching for hinges in fundamental circuits of a specific planar embedding of the constraint graph. We prove that the algorithm is correct. (C) 2014 Elsevier Ltd. All rights reserved. dc.format.extent 16 p. dc.language.iso eng dc.subject Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional dc.subject.lcsh Computational geometry dc.subject.other Geometric constraint solving dc.subject.other Graph decomposition dc.subject.other Fundamental circuits dc.subject.other Bridges dc.subject.other Planar embeddings dc.subject.other CONSTRUCTIVE APPROACH dc.subject.other SYSTEMS dc.subject.other SOLVER dc.subject.other ALGORITHM dc.subject.other DESIGN dc.subject.other PLANS dc.title Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity dc.type Article dc.subject.lemac Geometria computacional dc.contributor.group Universitat Politècnica de Catalunya. GIE - Grup d'Informàtica a l'Enginyeria dc.identifier.doi 10.1016/j.cad.2014.02.006 dc.identifier.dl Else dc.relation.publisherversion http://www.sciencedirect.com/science/article/pii/S001044851400030X dc.rights.access Restricted access - publisher's policy drac.iddocument 15015345 dc.description.version Postprint (published version) dc.date.lift 10000-01-01 upcommons.citation.author Joan-Arinyo, R.; Tarres, M.; Vila, S. upcommons.citation.published true upcommons.citation.publicationName Computer Aided Design upcommons.citation.volume 52 upcommons.citation.startingPage 1 upcommons.citation.endingPage 16
﻿

### This item appears in the following Collection(s)

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