Título:
|
Geometric constraint graphs decomposition based on computing graph circuits
|
Autor/a:
|
Joan Arinyo, Robert; Tarres Puertas, Marta Isabel; Vila Marta, Sebastià
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. Departament de Disseny i Programació de Sistemes Electrònics; Universitat Politècnica de Catalunya. GIE - Grup d'Informàtica a l'Enginyeria |
Abstract:
|
Geometric constraint solving is a growing field which plays a paramount
role in industrial applications and that is deeply rooted in automated deduction
in geometry. In this work we report on an algorithm to solve geometric
constraint-based problems by decomposing biconnected graphs. The algorithm is
based on recursively splitting the graph through sets with three vertices located
on fundamental circuits of the graph. Preliminary practical experiments suggest
that the algorithm runtime is at worst quadratic with the total number of vertices
in the graph. |
Materia(s):
|
-Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional -Computational geometry -Computer-aided design -Geometria computacional -Disseny assistit per ordinador |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión publicada Objeto de conferencia |
Editor:
|
East China Normal University
|
Compartir:
|
|