Revisiting decomposition analysis of geometric constraint graphs
Geometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques commonly used to analyze geometric constraint graphs in geometric constraint solvi...
| Autores: | , , , |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 2002 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97561 |
| Acesso em linha: | https://hdl.handle.net/2117/97561 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Decomposition analysis Geometric constraint Constraint solving Graph-based constraint solving Àrees temàtiques de la UPC::Informàtica |
| Resumo: | Geometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques commonly used to analyze geometric constraint graphs in geometric constraint solving. In this paper we first introduce the concept of {em deficit} of a constraint graph. Then we give a new formalization of the decomposition algorithm due to Owen. This new formalization is based on preserving the deficit rather than on computing triconnected components of the graph and is simpler. Finally we apply tree decompositions to prove that the class of problems solved by the formalizations studied here and other formalizations reported in the literature is the same. |
|---|