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

A 2D geometric constraint solver using a graph reduction method

โœ Scribed by Samy Ait-Aoudia; Sebti Foufou

Book ID
108050862
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
1002 KB
Volume
41
Category
Article
ISSN
0965-9978

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A 2-D geometric constraint solver using
A 2-D geometric constraint solver using DOF-based graph reduction
โœ Jae Yeol Lee; Kwangsoo Kim ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 598 KB

In this paper, we propose a new DOF-based graph reduction approach to geometric constraint solving. In the proposed approach, we incrementally solve a geometric constraint problem that is not ruler-and-compass constructible by incrementally identifying a set of constrained geometric entities with 3

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 method for system interface reduction
A method for system interface reduction using N2 charts
โœ Ofri Becker; Joseph Ben- Asher; Ilya Ackerman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 380 KB

This work focuses on system interface reduction using N 2 charts. The N 2 charts method, which has been first introduced by NASA, and the tools it provides for the systems engineer are explained and demonstrated here in detail. The system interface reduction problem is defined and introduced as find