On tree decomposability of Henneberg graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/99452

Title:	On tree decomposability of Henneberg graphs
Author:	Hidalgo, Marta R.; Joan Arinyo, Robert
Other authors:	Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. GIE - Grup d'Informàtica a l'Enginyeria
Abstract:	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 would be of help in transforming underconstrained problems into well constrained problems as well as in exploring alternative constructions over a given set of geometric elements.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Geometric constraint graphs -Tree-decomposition constructive technique
Rights:
Document type:	Article - Published version Report
Share: