By Topic

An incremental algorithm to support geometric constraint satisfaction in engineering design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lopes da Silva, A. ; Fed. Technol. Center of Goias, Salgado Oliveira Univ., Brazil ; Lamounier, E.

This paper presents a set of algorithms to efficiently support geometric constraint satisfaction during engineering design. Based upon an incremental graph construction approach, these algorithms satisfy each new inserted constraint by exploiting the degrees of freedom of the involved geometric entities. The objective is to avoid satisfying the entire constraint set from scratch due to a new constraint insertion. A prototype system has been developed and is presented to demonstrate the flexibility gained by the proposed incremental algorithms.

Published in:

Information Visualisation, 2002. Proceedings. Sixth International Conference on

Date of Conference: