loading...
Numerical Solving of Geometric Constraints
London, England July 10-July 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2002.1028766Sixth International Conference on Inf ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Samy Ait-Aoudia, Institut National de formation en Informatique
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 can't 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 non-linear equations within a region defined by bounds on each individual co-ordinate of the geometric objects.
Index Terms:
geometric modeling, constraints, bisection method
Citation:
Samy Ait-Aoudia, "Numerical Solving of Geometric Constraints," iv, pp.125, Sixth International Conference on Information Visualisation (IV'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.