16th Design Automation Conference: Volume 1 — Computer Aided and Computational Design
Latest Publications


TOTAL DOCUMENTS

42
(FIVE YEARS 0)

H-INDEX

0
(FIVE YEARS 0)

Published By American Society Of Mechanical Engineers

9780791805206

Author(s):  
Tin-Lup Wong ◽  
Junshi Wang ◽  
Karl K. Stevens

Abstract Simulations of surface mounted electronic assemblies under general mechanical loading conditions have been performed using an hybrid analytical/experimental analysis approach. This method combines analytical techniques with experimentally determined load-deformation characteristics of the surface-mounted assemblies to predict loadings and deformations of the assemblies. An automated analysis procedure which integrated the finite element method, optimization theory and the hybrid analysis approach was developed. This procedure can be used to study the strength of the surface mounted devices located anywhere on a printed circuit board subjected to the specified loading conditions.


Author(s):  
Andrew Kusiak ◽  
Edward Szczerbicki

Abstract In this paper a methodology for the specification stage in conceptual design is presented. It allows for problem solving in an active interaction with the designer. An important part of the proposed methodology is the requiremental and functional tree representing the overall logic and structure of the design problem. The specification stage aims at providing requirements and transforming them into functions of the designed object. It occurs at the highest level of abstraction and it must provide enough information to begin the synthesis process where functions are transformed into design components that are further synthesized into the designed object. The proposed approach was motivated by the following problems: specification of requirements, specification of functions, incorporation of logic into functional and requiremental trees, representation of requirements-functions interaction, and optimization in the functional space. The methodology presented is illustrated with examples.


Author(s):  
Nanxin Wang ◽  
Tulga M. Ozsoy

Abstract This paper presents an algorithm for generating tolerance chains from the mating relations between components of assemblies. The algorithm is developed upon a feature-based assembly modeling strategy that represents each component in close relation to its mating features, dimensions and tolerances. The mating relations within an assembly are described by a mating graph. Tolerance chains together with their dimensions and tolerances are generated automatically by searching through a mating graph for matching mating features. A prototype program package based on the presented algorithm has been developed, and several examples of various complexity have been tested with success.


Author(s):  
Joshua U. Turner ◽  
Michael J. Wozny

Abstract A rigorous mathematical theory of tolerances is an important step toward the automated solution of tolerancing problems. This paper develops a mathematical theory of tolerances in which tolerance specifications are interpreted as constraints on a normed vector space of model variations (M-space). This M-space provides concise representations for both dimensional and geometric tolerances, without deviating from the established tolerancing standards. This paper extends the authors’ previous work to include examples of geometric orientation and form tolerances. We show that the M-space theory supports the development of effective algorithms for the solution of tolerancing problems. Through the use of solid modeling technology, it is possible to automate the solution of such problems.


Author(s):  
M. A. Ganter ◽  
B. P. Isarankura

Abstract A technique termed space partitioning is employed which dramatically reduces the computation time required to detect dynamic collision during computer simulation. The simulated environment is composed of two nonconvex polyhedra traversing two general six degree of freedom trajectories. This space partitioning technique reduces collision detection time by subdividing the space containing a given object into a set of linear partitions. Using these partitions, all testing can be confined to the local region of overlap between the two objects. Further, all entities contained in the partitions inside the region of overlap are ordered based on their respective minimums and maximums to further reduce testing. Experimental results indicate a worst-case collision detection time for two one thousand faced objects is approximately three seconds per trajectory step.


Author(s):  
N. M. Patrikalakis ◽  
H. N. Gursoy

Abstract In this paper we develop a new interrogation method based on the medial axis transform to extract some important global shape characteristics from geometric representations. These shape characteristics include constrictions, maximum thickness points, and associated length scales; isolation of holes and their proximity information; and a set of topologically simple subdomains decomposing a complex domain. The algorithm we develop to compute the medial axis transform of planar multiply connected shapes with curved boundaries can automatically identify these characteristics. Higher level algorithms for generation of finite element meshes of planar multiply connected domains, adaptive triangulation and approximation of trimmed curved surface patches and other engineering applications using the medial axis transform are also discussed.


Author(s):  
T. L. DeFazio ◽  
A. C. Edsall ◽  
R. E. Gustavson ◽  
J. A. Hernandez ◽  
P. M. Hutchins ◽  
...  

Abstract This paper describes a prototype software system that implements a form of feature-based design for assembly. It is not an automated design system but instead a decision and design aid for designers interested in Concurrent Design. Feature-based design captures design intent (assembly topology, product function, manufacturing, or field use) while creating part and product geometry. Design for assembly as used here extends existing ideas about critiquing part shapes and part count to include assembly process planning, assembly sequence generation, assembly fixturing assessments, and assembly process costs. This work was primarily Interested in identifying the information important to DFA tasks, and how that information could be captured using feature-based design. It was not intended to extend the state of the art in feature-based geometry creation, but rather to explore the uses of the information that can be captured. The prototype system has been programmed in LISP on Sun workstations. Its research contributions comprise integration of feature-based design with several existing and new assembly analysis and synthesis algorithms; construction of feature properties to meet the needs of those algorithms; a carefully chosen division of labor between designer and computer; and illustration of feature-based models of products as the information source for assembly analysis and process design. Some of its functions have been implemented approximately or partially but they give the flavor of the benefits to be expected from a fully functional system.


Author(s):  
Alexander Kott ◽  
Gerald Agin ◽  
Dave Fawcett

Abstract Configuration is a process of generating a definitive description of a product or an order that satisfies a set of specified requirements and known constraints. Knowledge-based technology is an enabling factor in automation of configuration tasks found in the business operation. In this paper, we describe a configuration technique that is well suited for configuring “decomposable” artifacts with reasonably well defined structure and constraints. This technique may be classified as a member of a general class of decompositional approaches to configuration. The domain knowledge is structured as a general model of the artifact, an and-or hierarchy of the artifact’s elements, features, and characteristics. The model includes constraints and local specialists which are attached to the elements of the and-or-tree. Given the specific configuration requirements, the problem solving engine searches for a solution, a subtree, that satisfies the requirements and the applicable constraints. We describe an application of this approach that performs configuration and design of an automotive component.


Author(s):  
Joanna M. Brown ◽  
Malcolm I. G. Bloor ◽  
M. Susan Bloor ◽  
Michael J. Wilson

Abstract A PDE surface is generated by solving partial differential equations subject to boundary conditions. To obtain an approximation of the PDE surface in the form of a B-spline surface the finite element method, with the basis formed from B-spline basis functions, can be used to solve the equations. The procedure is simplest when uniform B-splines are used, but it is also feasible, and in some cases desirable, to use non-uniform B-splines. It will also be shown that it is possible, if required, to modify the non-uniform B-spline approximation in a variety of ways, using the properties of B-spline surfaces.


Author(s):  
Chandrasekhar Karra ◽  
Thomas A. Phelps

Abstract The success of any industry in today’s highly competitive market is largely dependent on its ability to produce quality products, quickly and at low cost. Evaluating the effect of a product design on its manufacture is crucial in developing efficient designs. Any potential manufacturing problems detected at this stage can be corrected by modifying the design, leading to shorter product development cycles and lower production costs. This paper presents an algorithm to determine feasible tool approach directions. The algorithm is based on detecting if any part of the object obstructs the tool path. The basis for the algorithm is determining feasible approach directions and clearances around a planar polygonal face. The algorithm is applicable to both protrusions and depressions. The information is useful in performing manufacturability analysis of designs and develop process plans.


Sign in / Sign up

Export Citation Format

Share Document