Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Sixth International Conference on Information Visualisation (IV'02)   p. 125
Numerical Solving of Geometric Constraints

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2002.1028766
Send link to a friend

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 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.
Additional Information
Index Terms- geometric modeling, constraints, bisection method

Citation:  Samy Ait-Aoudia, "Numerical Solving of Geometric Constraints," iv, p. 125,  Sixth International Conference on Information Visualisation (IV'02),  2002

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback