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.
CitationJoan-Arinyo, R., Tarres, M., Vila-Marta, S. Geometric constraint graphs decomposition based on computing graph circuits. A: "Aplicación de herramientas CAD a realidad virtual: representaciones jerárquicas y luces virtuales". Granada: Copicentro, 2010, p. 7-13.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com