Share Email Print
cover

Proceedings Paper

Novel algorithm for geometric constraint satisfaction
Author(s): Liping Chen; Hao Luo; Chongbin Tu; Xingfang Zhang; Ji Zhou; Jun Yu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A new solving method for geometric constraint reasoning is presented in this paper which has been named as maximal-reduction algorithm (MRA). It is the application about constraint network theory, analysis of degree of freedom, sparse matrix, and graph theory. With the MRA, geometric constraint system can be transformed into a series of subsystem which are organized with a forest data structure finally. The strategy enables the time complexity to solve the system separated with the scale of the system. It improves the solving stability and time expenses greatly. An interesting character of the MRA is its generalization which gives itself wide applications including parametric drawing, parametric modeling, kinematics of multibody system and product assembly.

Paper Details

Date Published: 22 March 1996
PDF: 6 pages
Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235582
Show Author Affiliations
Liping Chen, Huazhong Univ. of Science and Technology (China)
Hao Luo, Huazhong Univ. of Science and Technology (China)
Chongbin Tu, Huazhong Univ. of Science and Technology (China)
Xingfang Zhang, Huazhong Univ. of Science and Technology (China)
Ji Zhou, Huazhong Univ. of Science and Technology (China)
Jun Yu, Huazhong Univ. of Science and Technology (China)


Published in SPIE Proceedings Vol. 2644:
Fourth International Conference on Computer-Aided Design and Computer Graphics

© SPIE. Terms of Use
Back to Top