𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Geometric algorithms for containment analysis of rotational parts

✍ Scribed by Mukul Karnik; Satyandra K. Gupta; Edward B. Magrab


Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
959 KB
Volume
37
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis


This paper describes a system and underlying algorithms to perform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test for containment. The first step analyzes feasibility of containment using bounding cylinders. If the bounding cylinder of the query part is bigger than the part in the database, then the database part cannot contain the query part and it is eliminated from consideration. The second step analyzes feasibility of containment by ignoring off-axis features. Any part that fails to satisfy containment at this stage is eliminated from consideration. The third step analyzes the remaining parts from the database for feasibility of containment by including the off-axis features. Finally, the system rankorders all the database parts that can contain the query part based on their volume differences with the query part. The system described in this paper can be used by designers and process planners to find an existing part that can be used as a stock to manufacture a newly designed part. This capability is expected to significantly reduce proliferation of parts, to improve manufacturing responsiveness, and to reduce the cost of new products.


πŸ“œ SIMILAR VOLUMES


Geometric algorithms for the conformatio
✍ J. CortΓ©s; T. SimΓ©on; M. Remaud-SimΓ©on; V. Tran πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 384 KB

## Abstract The efficient filtering of unfeasible conformations would considerably benefit the exploration of the conformational space when searching for minimum energy structures or during molecular simulation. The most important conditions for filtering are the maintenance of molecular chain inte

Decomposition Plans for Geometric Constr
✍ Christoph M. Hoffman; Andrew Lomonosov; Meera Sitharam πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 409 KB

We systematically design two new decomposition-recombination (DR) planners, geared to perform well with respect to several performance measures. The DR-planning problem and the performance measures were formally defined in Part I of this paper to closely reflect specific requirements of CAD/CAM appl

A predictor algorithm for fast geometric
✍ Ji Won Suk; Jong Hoon Kim; Yong Hyup Kim πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 929 KB

An efficient predictor algorithm is presented for fast geometrically-nonlinear dynamic analysis. The basic concept of this algorithm entails the use of the predicted starting point close to the converged solution point in the iterative procedure of nonlinear dynamics. The predicted starting point is

Co-rotational formulation for geometric
✍ Wen Yi Lin; Kuo Mo Hsiao πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 397 KB

A doubly symmetric thin-walled beam element with open section is derived using co-rotational (CR) total Lagrangian (TL) formulation. The eects of deformation-dependent third-order terms of element nodal forces on the buckling load and post-buckling behavior are investigated. All coupling among bendi