Abstract:
|
In this report an algorithm for the satisfaction of
geometric constraints of distance in 2D models is proposed. It is
based on the step-by-step relaxation of each constraint and, under
well-bounded conditions, it converges to the desired solution. First,
several basic definitions are formalized. Next, the method is
presented and discussed. Finally, its convergence is proved on the
basis of the analysis of the euclidean norm evolution, which is
associated to the constraints of a model. |