In this paper, a new relaxation algorithm for solving geometric
constraint-based models is proposed. The algorithm starts from a
constructive symbolic representation of objects (Constructive
Parametric Solid Model, CPSM) and proceeds by iterative relaxation of
the geometric constraints. Models that can be reduced to distance
and angle constraints can be handled. A new algorithm based on an
iterative global deformation of the system is presented and
discussed, and its convergence is proved. The performance of hybrid
algorithms involving global deformation and individual constraint
relaxation is discussed on several practical cases.
CitationSolano, L., Brunet, P. "A Geometric relaxation solver for parametric constraint-based models". 1998.
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