Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Korean Journal of Computational Design and Engineering
Journal Basic Information
Journal DOI :
Society of CAD/CAM Engineers
Editor in Chief :
Volume & Issues
Volume 2, Issue 4 - Dec 1997
Volume 2, Issue 3 - Sep 1997
Volume 2, Issue 2 - Jun 1997
Volume 2, Issue 1 - Mar 1997
Selecting the target year
Efficient generation of reflection lines to evaluate car body surfaces
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 133~141
In the process of car body design, various surfaces are generated from the given boundary curves. Depending upon the method of the surface generation and the quality of the boundary curves provided, the resulting surfaces may have global or local irregularities in many cases. Thus it would be necessary for the designer to evaluate the surface quality and to modify the surface or to use the different generation method based on the evaluation results. This capability is very important because the defect of the surface quality detected in the production stage will require the rework of the dies and will cause a big loss in cost and time. A method of surface interrogation using reflection line is introduced. In this paper, We applied reflection mapping to generate reflection lines on the trimmed NURBS surface. Since reflection lines are obtained from reflection mapping that uses simple and physically acceptable mapping algorithm, they can be efficiently used to simulate the reflection test on the real part in the production line.
A Study on the Expression of Features Interaction
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 142~149
This study is intended to develop a Feature based modeler. It is difficult to integrate CAD and CAM/CAPP with information that is given only by a conventional CAD system. Therefore a lot of studies have concentrated on a Feature based CAD system. But conventional Feature based modelers have had limitation on providing sufficient information related to Feature interaction. If a Feature based modeler is to be used in assembly simulation, a new Feature-based modeling method needs to be developed. Also to support collision detection between parts, we have to handle Feature interaction systematically. Therefore we suggest Cell data structure which handles interaction of Features by volume. The volume created by Feature interaction is saved as a Cell. With the Cell structure we solve problems involved with Feature interaction. This study shows how the Cell data structure can manage Feature interaction and give enough information in assembly simulation.
Optional Storage of Non-manifold Information for Solid Models
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 150~160
Existing non-manifold data structures which use the ordered topological representation method, are designed based on a "Model" which is the highest topological entity. Their non-manifold information is always included in edges and vertices even if they are in the manifold situation. Thus they require large storage spaces than manifold data structures. The proposed data structure reduces its storage space by removing unnecessary information stored in edges and vertices. Topological information is classified into manifold and non-manifold information. The main non-manifold information is radial cycles and disk cycles. The proposed data structure always stores manifold information. For the non-manifold situation, the edge stores radial cycles, and the vertex stores disk cycles. The storage space can be reduced in the later stage of CAD design when the ratio of non-manifold to manifold entities is small.
Graphic Simulation of Material Removal Process Using Bounding Box and Base Plane
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 161~174
In this paper, the techniques for graphic simulation of material removal process are described. The concepts of the bounding box and base plane are proposed. With these concepts, a real-time shaded display of a Z-map model being milled by a cutting tool following an NC path can be implemented very efficiently. The base planes make it possible to detect the visible face of Z-map model effectively. And the bounding box of tool sweep volume provides minimum area of screen to be updated. The proposed techniques are suitable for implementation in raster graphic device and need a few memories and a small amount of calculation. Proposed method is written in C and executable on MS-Windows95 and Window-NT.
Geometric Detail Suppression for the Generation of Efficient Finite Elements
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 175~185
Given the widespread use of the Finite Element Method in strength analysis, automatic mesh generation is an important component in the computer-aided design of parts and assemblies. For a given resolution of geometric accuracy, the purpose of mesh generators is to discretize the continuous model of a part within this error limit. Sticking to this condition often produces many small elements around small features in spite that these regions are usually of little interest and computer resources are thus wasted. Therefore, it is desirable to selectively suppress small features from the model before discretization. This can be achieved by low-pass filtering a CAD model. A spatial function of one dimension higher than the model of interest is represented using the Fourier basis functions and the region where the function yields a value greater than a prescribed value is considered as the extent of a shape. Subsequently, the spatial function is low-pass filtered, yielding a shape without the small features. As an undesirable effect to this operation, all sharp corners are rounded. Preservation of sharp corners is important since stress concentrations might occur there. This is why the LPF (low-pass filtered) model can not be directly used. Instead, the distances of the boundary elements of the original shape from the LPF model are calculated and those that are far from the LPF model are identified and removed. It is shown that the number of mesh elements generated on the simplified model is much less than that of the original model.
Determination of Cutting Orientation in Zigzag Milling Operationa: A Geometrical Approach;
Kim, Byeong Keuk ; Park, Joon Young ; Wee, Nam-Sook ;
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 186~194
This paper describes new methods to minimize the cutting time in zigzag milling operation of two dimensional polygonal surfaces. Previous works have been focused on mainly experimental approaches by considering some machining parameters such as, spindle speed, depth of cut, cutter traverse rate, cutter diameter, number of teeth, tool wear, life of tool, and so on. However, in this study, we considered two geometrical factors one by one in order to see the effect separately, which are the length of cut and the number of cutter traverse. In an N-sided concave or convex polygon, an algorithm has been developed which minimize the total length of cut. Also, a heuristic approach was used to minimize the number of cutter traverse.
Optimal 3-D Packing using 2-D Slice Data for Multiple Parts Layout in Rapid Prototyping
Korean Journal of Computational Design and Engineering, volume 2, issue 3, 1997, Pages 195~210
In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.