• 한국CDE학회논문집
• /
• 제8권4호
• /
• pp.262-269
• /
• 2003

An approach to compute characteristic curves such as section curves, reflection characteristic lines, and asymptotic curves on a surface is introduced. Each problem is formulated as a surface-plane inter-section problem. A single-valued function that represents the characteristics of a problem constructs a property surface on parametric space. Using a contouring algorithm, the property surface is intersected with a horizontal plane. The solution of the intersection yields a series of points which are mapped into object space to become characteristic curves. The approach proposed in this paper eliminates the use of traditional searching methods or non-linear differential equation solvers. Since the contouring algorithm has been known to be very robust and rapid, most of the problems are solved efficiently in realtime for the purpose of visualization. This approach can be extended to any geometric problem, if used with an appropriate formulation.

• 한국CDE학회논문집
• /
• 제1권3호
• /
• pp.189-202
• /
• 1996

Complex geometric shapes can be defined simply and efficiently by combining and operating various surface primitives. These primitives and their intersection curves are used in finite element mesh generation to form an easy and intuitive procedure for finite element modelling of curved surfaces. This paper proposes techniques of automatic mesh generation on surface primitives with arbitrarily shaped boundaries and control curves, which may be created by surface to surface intersection. A method of automatic mesh generation on plane, which was previously developed by the author, has been modified for application to the surface mesh generation. Owing to the mesh generation-wise differences between planes and surfaces, the surfaces should be transformed into conceptual plane so that the modified plane mesh generation method can be applied. Surface development, mapping and mesh reconstruction are the key techniques suggested in this paper. The selection of the technique to apply can be determined automatically on the basis of the developability, existence of singularity and other characteristics of the surfaces on which the mesh is to be generated. The suggested techniques were implemented into parts of mesh generation functions of the finite element software, MacTran. Their validity and practicality were manifested by the actual use of this software.

• 한국CDE학회논문집
• /
• 제3권2호
• /
• pp.127-134
• /
• 1998

This paper presents d new algorithm to compute the offlet curve of a given planar parametric curve. We reduce the problem of computing an offset curve to that of intersecting a surface to a paraboloid. Given an input curve C(t)=(x(t), y(t))∈R², the corresponding surface D/sub c(t)/ is constructed symbolically as the envelope surface of a one-parameter family of tangent planes of the paraboloid Q:z=x²+y²along a lifted curve C(t)=(x(t), y(t), x(t)²+y(t)²∈Q. Given an offset distance d∈R, the offset curve C/sub d/(t) is obtained by the projection of the intersection curve of D/sub c(t)/ and a paraboloid Q:z=x²+y²-d² into the xy-plane.

• 한국정밀공학회지
• /
• 제17권1호
• /
• pp.27-33
• /
• 2000

This paper presents a method for determining machining parameters in 3-dimentional electrical discharge machining(EDM). The parameters are the peak value of currents, the pulse-on time, and the pulse-off time. It is known that they influence the performance of EDM more than the other else. The parameters are determined from the discharge area between a tool electrode and a work piece. The discharge area is directly influenced by the geometry of a tool surface and the tool discharge position. The discharge area on a tool discharge position is calculated from intersection curves between the tool surface and a horizontal plane. The grid search method is applied to determine the intersection curves. An example is introduced to show that the machining parameters are obtained from the surface geometry of a tool electrode.

• 한국정밀공학회지
• /
• 제26권2호
• /
• pp.133-140
• /
• 2009

Presented in this paper is a method to generate round-endmill toolpaths for sculptured surfaces represented as a triangular mesh model. The proposed method is applicable in toolpath generation for ball-endmills and flat-endmills because the round-endmill is a generalized tool in three-axis NC (numerical control) milling. The method uses a wireframe model as the offset model that represents a cutter location surface. Since wireframe models are relatively simple and fast to calculate, the proposed method can process large models and keep high precision. Intersection points with the wireframe offset model and a tool guide plane are calculated, and intersection curves are constructed by tracing the intersection points. The final step of the method is extracting regular curves from the intersection curves including degenerate and self-intersected segments. The proposed method is implemented and tested, and a practical example is presented.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 춘계학술대회 논문집
• /
• pp.429-433
• /
• 1995

Compound solid is maded for specially fixed object. A number of compound soild are devided as a unit germetric solid. The special case of rotation about an arbitrary axis makes according selection modelfor transformation. View plane and View region are estiblished for back face removal. After back-face removal eachedge is checked for point of intersection. The designing of of fset surface id maded and tool-path gernerted on the part surface. In tersection point is checked among the offset surfaces. The paper used an efficient algorithm for generating tool paths to apply a notion view volume. Through machining experiments with a 3-axis machining centre, the adequacy of the analysis was confirmed.

• 대한의용생체공학회:의공학회지
• /
• 제26권2호
• /
• pp.73-86
• /
• 2005

We need to flatten the brain cortex to smooth surface, sphere, or 2D plane in order to view the buried sulci. The rendered 3D surface of the segmented white matter and gray matter does not have the topology of a sphere due to the partial volume effect and segmentation error. A surface without correct topology may lead to incorrect interpretation of local structural relationships and prevent cortical unfolding. Although some algorithms try to correct topology, they require heavy computation and fail to follow the deep and narrow sulci. This paper proposes a method that corrects topology of the rendered surface fast, accurately, and automatically. The proposed method removes fractions beside the main surface, fills cavities in the inside of the main surface, and removes handles in the surface. The proposed method to remove handles has three-step approach. Step 1 performs smoothing operation on the rendered surface. In Step 2, vertices of sphere are gradually deformed to the smoothed surfaces and finally to the boundary of the segmented white matter and gray matter. The Step 2 uses multi-resolutional approach to prevent the deep sulci from geometrical intersection. In Step 3, 3D binary image is constructed from the deformed sphere of Step 2 and 3D surface is regenerated from the 3D binary image to remove intersection that may happen. The experimental results show that the topology is corrected while principle sulci and gyri are preserved and the computation amount is acceptable.

• 공학논문집
• /
• 제8권1호
• /
• pp.51-57
• /
• 2006

We propose efficient methods for implementing 3-D reconstruction algorithms for Compton camera. Since reconstructing Compton scattered data involves the surface integral over the cone associated with the measurement bin, it is crucial to develop a computationally efficient surface integration method. In this work we assume that a cone is made up of a series of ellipses (or circles) stacked up one o top of the other. In order to reduce computational burden for tracing ellipses formed by the intersection of a cone and an image plane, we construct a series of imaginary planes perpendicular to the cone axis so that each plane contains a circle, not an ellipse. In this case the surface integral can be performed by adding uniform samples along each circle. The experimental results demonstrate that our method using imaginary planes significantly improves computational efficiency while keeping reconstruction accuracy.

• 한국정밀공학회지
• /
• 제16권9호
• /
• pp.172-178
• /
• 1999

3D linear and circular interpolations are a basic part for the machining of complex shapes. Until now, because of the absence of appropriate algorithms for the generation of 3D lines and circles, a full accomplishment for available machine tool resolution is difficult. this paper presents new algorithms for 3D linear and circular interpolation in the reference pulse technique. In 3D space, the line or circle is not expressed as an implicit function, it is only defined as the intersection of two surfaces. A 3D line is defined as the intersection of two planes, and a 3D circle is defined as the intersection of a plane and the surface of a sphere. Based on these concepts, interpolation algorithms are designed to follow intersection curves in 3D space, and a real-time 3D linear and circular interpolator was developed in software using a PC. The algorithm implemented in a PC showed promising results in interpolation error and speed performance. It is expected that it can be applied to the next generation computerized numerical control systems for the machining of 3D lines, circles and some other complex shapes.

• 한국정밀공학회지
• /
• 제24권11호
• /
• pp.144-153
• /
• 2007

In order to generate the input data for rapid prototyping, a new approach which is based on the implicit surface interpolation method is presented. In the method a surface is reconstructed by creating smooth implicit surface from unorganized cloud of points through which the surface should pass. In the method an implicit surface is defined by the adaptive local shape functions including quadratic polynomial function, cubic polynomial function and RBF(Radial Basis Function). By the reconstruction of a surface, various types of error in raw STL file including degenerated triangles, undesirable holes with complex shapes and overlaps between triangles can be eliminated automatically. In order to get the slicing data for rapid prototyping an efficient intersection algorithm between implicit surface and plane is developed. For the direct usage for rapid prototyping, a robust transformation algorithm for the generation of complete STL data of solid type is also suggested.