๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solving 3D geometric constraints for closed-loop assemblies

โœ Scribed by J.S. Kim; K.S. Kim; J.Y. Lee; H.B. Jung

Publisher
Springer
Year
2004
Tongue
English
Weight
396 KB
Volume
23
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A C-tree decomposition algorithm for 2D
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
โœ Xiao-Shan Gao; Qiang Lin; Gui-Fang Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 311 KB

In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in

A Systematic Framework for Solving Geome
A Systematic Framework for Solving Geometric Constraints Analytically
โœ Cassiano Durand; Christoph M. Hoffmann ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 600 KB

A systematic framework is presented for solving algebraic equations arising in geometric constraint solving. The framework has been used successfully to solve a family of spatial geometric constraint problems. The approach combines geometric reasoning, symbolic reduction, and homotopy continuation.