Show simple item record

dc.contributor.authorHidalgo, Marta R.
dc.contributor.authorJoan Arinyo, Robert
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2017-03-08T18:57:16Z
dc.date.available2019-04-30T00:30:46Z
dc.date.issued2017-03-01
dc.identifier.citationHidalgo, M., Joan-Arinyo, R. A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs. "Journal of symbolic computation", 1 Març 2017, vol. 79, Part 2, p. 232-248.
dc.identifier.issn0747-7171
dc.identifier.urihttp://hdl.handle.net/2117/102162
dc.description.abstractIn this work we describe an algorithm to generate tree-decomposable minimally rigid graphs on a given set of vertices V . The main idea is based on the well-known fact that all minimally rigid graphs, also known as Laman graphs, can be generated via Henneberg sequences. Given that not each minimally rigid graph is tree-decomposable, we identify a set of conditions on the way Henneberg steps are applied so that the resulting graph is tree-decomposable. We show that the worst case running time of the algorithm is O(|V|3).
dc.format.extent17 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.lcshGraph algorithms
dc.subject.otherMinimally rigid graphs
dc.subject.otherLaman graphs
dc.subject.otherHenneberg sequences
dc.subject.otherGeometric constraint solving
dc.subject.otherGeometric constraint graphs
dc.subject.otherTree-decomposition
dc.titleA Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
dc.typeArticle
dc.subject.lemacAlgorismes de grafs
dc.contributor.groupUniversitat Politècnica de Catalunya. GIE - Grup d'Informàtica a l'Enginyeria
dc.identifier.doi10.1016/j.jsc.2016.02.006
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0747717116000158
dc.rights.accessOpen Access
drac.iddocument19343153
dc.description.versionPostprint (author's final draft)
upcommons.citation.authorHidalgo, M., Joan-Arinyo, R.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameJournal of symbolic computation
upcommons.citation.volume79, Part 2
upcommons.citation.startingPage232
upcommons.citation.endingPage248


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain