DocumentCode
2172355
Title
Numerical solving of geometric constraints
Author
Ait-Aoudia, Samy
Author_Institution
Inst. Nat. de Formation en Informatique, Algeria
fYear
2002
fDate
2002
Firstpage
125
Lastpage
129
Abstract
In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships, called constraints between geometric elements. The problem is to derive automatically these geometric elements. Many resolution methods have been proposed for solving systems of geometric constraints. Geometric methods can be very efficient but are only applicable to particular kinds of problems (typically rule and compass constructive problems). Some schemes cannot be solved by any geometric method. A numerical method is then necessary. We use the bisection method to solve these "difficult" cases. The bisection method enables users to reliably find all solutions to a system of nonlinear equations within a region defined by bounds on each individual coordinate of the geometric objects.
Keywords
computational geometry; constraint theory; solid modelling; Krawczyk-Moore test; Newton iteration; bisection method; constraints decomposition; geometric constraints; geometric modeling; nonlinear equations; Design automation; Nonlinear equations; Object oriented modeling; Object oriented programming; Shape; Solid modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Visualisation, 2002. Proceedings. Sixth International Conference on
ISSN
1093-9547
Print_ISBN
0-7695-1656-4
Type
conf
DOI
10.1109/IV.2002.1028766
Filename
1028766
Link To Document