22 March 1996 Novel algorithm for geometric constraint satisfaction
Author Affiliations +
Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235582
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China
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.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Liping Chen, Liping Chen, Hao Luo, Hao Luo, Chongbin Tu, Chongbin Tu, Xingfang Zhang, Xingfang Zhang, Ji Zhou, Ji Zhou, Jun Yu, Jun Yu, } "Novel algorithm for geometric constraint satisfaction", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235582; https://doi.org/10.1117/12.235582
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

HIRES the high resolution spectrograph for the E ELT ...
Proceedings of SPIE (August 09 2016)
Measuring of network vulnerability
Proceedings of SPIE (September 02 2003)
Interactive assembly modeling method
Proceedings of SPIE (March 22 1996)
Extraction of events and rules of land use cover change...
Proceedings of SPIE (August 15 2007)

Back to Top