Now showing items 1-2 of 2

  • A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs 

    Hidalgo, Marta R.; Joan Arinyo, Robert (2017-03-01)
    Article
    Open Access
    In 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 ...
  • On tree decomposability of Henneberg graphs 

    Hidalgo, Marta R.; Joan Arinyo, Robert (2014)
    External research report
    Open Access
    In this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the tree-decomposition constructive technique. The algorithm is based on Henneberg constructions and ...