• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.89-100
• /
• 2001

Swept volume is the sweeping region of moving objects. It is used in various applications such as interference detection in assembly design, visualization of manipulator motions in robotics, simulation of the volume removal by a cutter in NC machining. The shape of swept volume is defined by the envelope, which is determined by the boundary of moving objects and its direction of motion. In order to implement the generation of swept volume, researchers have taken much effort to develop the techniques how to generate the envelope. However, their results are confined to envelope generated only in simple shape objects, such as polyhedra or quadric surfaces. This study provided the envelope generation algorithm of NURBS objects. Characteristic points were obtained by applying the geometric conditions of envelope to NURBS equations, and then characteristic curves were created by means of interpolating those points. Silhouette edges were determined in the following procedures. First, two adjacent surfaces which have the same edge were found from B-Rep data. Then, by taking the scalar product of velocity vector of a point on that edge with each normal vector on two surfaces, silhouette edges were discriminated. Finally, envelope was generated along moving direction in the form of ruled surfaces by using both the partial information between initial and final position of objects affecting envelope along with characteristic curves and silhouette edge. Since this developed algorithm can be applied not only to NURBS objects but also to their Boolean objects, it can be used effectively in various applications.

• 한국정밀공학회지
• /
• 제23권9호
• /
• pp.200-207
• /
• 2006

In this paper a new approach which combines implicit surface scheme and NURBS surface interpolation method is proposed in order to generate a complete surface model from unorganized point cloud data. In the method a base surface was generated by creating smooth implicit surface from the input point cloud data through which the actual surface would pass. The implicit surface was defined by a combination of shape functions including quadratic polynomial function, cubic polynomial functions and radial basis function using adaptive domain decomposition method. In this paper voxel data which can be extracted easily from the base implicit surface were used in order to generate rectangular net with good quality using the normal projection and smoothing scheme. After generating the interior points and tangential vectors in each rectangular region considering the required accuracy, the NURBS surface were constructed by interpolating the rectangular array of points using boundary tangential vectors which assure C$^1$ continuity between rectangular patches. The validity and effectiveness of this new approach was demonstrated by performing numerical experiments for the various types of point cloud data.

• 한국정밀공학회지
• /
• 제10권4호
• /
• pp.81-93
• /
• 1993

The three dimensional(3D) shape reconstruction from two dimensional(2D) cross-sections can be completed through three main phases : the input compilation, the triangular grid formation, and the smooth surface construction. In the input compilation phase, the cross-sections are analyzed to exctract the input data required for the shape reconstruction. This data includes the number of polygonized contours per cross-section and the vertices defining each polygonized contour. In the triangular grid formation phase, a triangular grid, leading to a polyhedral approximations, is constructed by extracting all the information concerning contour links between two adjacent cross- sections and then performing the appropriate triangulation procedure for each contour link. In the smooth surface construction phase, a smooth composite surface interpolating all vertices on the triangular grid is constructed. Both the smooth surface and the polyhedral approximation can be used as reconstructed models of the object. This paper proposes a new method for reconstructing the geometric model of a 3D objdect from a sequence of planar contours representing 2D cross-sections of the objdect. The method includes the triangular grid formation algorithms for contour closing, one-to-one branching, and one-to-many braanching, and many-to-many branching. The shape reconstruction method has been implemented on a SUN workstation in C.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.7-10
• /
• 2008

We present a technique for constructing a digital elevation model (DEM) from contours. The elevation of each ground point in DEM is computed by interpolating the heights of the two adjacent contours of the point. The technique decomposes each sub-domain between adjacent contours into a set of sub-regions. The decomposition is accomplished by constructing a medial axis of the sub-domain. Each sub-region in the decomposition is classified into a variety of terrain features like hillsides, valleys, ridges, etc. The elevations of points are interpolated with different methods according to terrain features they belong to. For a given point in hillside, an approximate gradient line passing through the point is determined and the elevation of the point is interpolated from the known elevations of the two adjacent contours along the approximate gradient line. The univariate monotone rational Hermite spline is used for the interpolation. The DEM constructed by the technique is to be used to orthorectify the high-resolution KOMPSAT3 imagery.

• 한국전산유체공학회지
• /
• 제19권2호
• /
• pp.58-65
• /
• 2014

The adaptive wavelet method is studied for the enhancement of computational efficiency of three-dimensional flows. For implementation of the method for three-dimensional Euler equation, wavelet decomposition process is introduced based on the previous two-dimensional adaptive wavelet method. The order of numerical accuracy of an original solver is preserved by applying modified thresholding value. In order to assess the efficiency of the proposed algorithm, the method is applied to the computation of flow field around ONERA-M6 wing in transonic regime with 4th and 6th order interpolating polynomial respectively. Through the application, it is confirmed that the three-dimensional adaptive wavelet method can reduce the computational time while conserving the numerical accuracy of an original solver.

• 대한의용생체공학회:의공학회지
• /
• 제23권6호
• /
• pp.491-498
• /
• 2002

3차원 의학영상처리 분야에서는 단면 해상도가 종축 방향의 공간 해상도보다 높은 비균등한 볼륨 데이터가 많이 사용된다 본 논문은 비균등한 볼륨 데이터를 효율적으로 렌더링하기 위하여 인접한 두 슬라이스상에 있는 복셀에서의 광도를 보간하여 중간 복셀의 광도를 직접 계산하는 방법을 제안한다. 기존 렌더링 방법과 달리 이 방법은 중간 슬라이스를 만들기 위해 전처리과정을 거치지 않으며 생성된 중간 슬라이스를 저장하기 위한 기억공간도 필요 없다 이 방법을 고속 볼륨 렌더링 알고리즘인 쉬어왑 분해 알고리즘에 적용한 사례를 통해 제안된 방법이 기존 방법보다 화질상의 손상 없이 속도가 향상됨을 보인다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.329-332
• /
• 2007

Annual vegetation growth patterns are determined by the intrinsic phenological characteristics of each land cover types. So, if typical growth patterns of each land cover types are well-estimated, and a NDVI time-series data of a certain area is compared to those estimated patterns, we can implement more advanced analyses such as a land surface-type classification or a land surface type change detection. In this study, we utilized Terra MODIS NDVI 250m data and compressed full annual NDVI time series data into several indices using the Harmonic Analysis of Time Series(HANTS) algorithm which extracts the most significant frequencies expected to be presented in the original NDVI time-series data. Then, we found these frequencies patterns, described by amplitude and phase data, were significantly different from each other according to vegetation types and these could be used for land cover classification. However, in spite of the capabilities of the HANTS algorithm for detecting and interpolating cloud-contaminated NDVI values, some distorted NDVI pixels of June, July and August, as well as the long rainy season in Korea, are not properly corrected. In particular, in the case of two or three successive NDVI time-series data, which are severely affected by clouds, the HANTS algorithm outputted wrong results.

• Journal of Welding and Joining
• /
• 제8권3호
• /
• pp.60-69
• /
• 1990

Plasma arc cutting is a fusion cutting process in which a gas-constricted arc is employed to produce a high-temperature, high-velocity plasma jet on the workpiece. This process provides some advantages such as increased cutting velocity, excellent working accuracy and the ability to cut special materials (widely used stainless steels and Al-alloys, for example), when compared with iconventional oxyfuel gas cutting. From the view point of price and reliability of the power source, plasma arc cutting has also some distinct advantages over laser beam cutting. High-speed machines with NC or CNC systems are needed for the plasma arc or laser beam cutting process, while for oxyfuel gas cutting, low-speed machines with copying templates or optical-shape tracking sensors can be applied. The low price and high flexibility of the microprocessor arc contributing more and more the application of CNC system in the plasma arc cutting process, as in other manufacturing fields. From these points of view, a microprocessor-based plasma arc cutting system was developed by using a reference-pulse system, and its performance was tested. The interpolating routines were programmed in the assembly language for saving the memory volume and improving the compouting speed, which has an intimate relationship with the available cutting velocity.

• 한국정밀공학회지
• /
• 제29권6호
• /
• pp.607-612
• /
• 2012

The wear problem of wheel flange occurs at sharp curves of rail. This paper proposes a procedure for optimum design of a wheel profile wherein flange wear is reduced by improving an interaction between wheel and rail. Application of optimization method to design problem mainly depends on characteristics of design space. This paper compared local optimization method with global optimization according to sensitivity value of objective function for design variables to find out which optimization method is appropriable to minimize wear of wheel flange. Wheel profile is created by a piecewise cubic Hermite interpolating polynomial and dynamic performances are analyzed by a railway dynamic analysis program, VAMPIRE. From the optimization results, it is verified that the global optimization method such as genetic algorithm is more suitable to wheel profile optimization than the local optimization of SQP (Sequential Quadratic Programming) in case of considering the lack of empirical knowledge for initial design value.

• International Journal of Aeronautical and Space Sciences
• /
• 제12권4호
• /
• pp.365-370
• /
• 2011

This paper presents the air-to-air missile autopilot design for a $180^{\circ}$ heading reversal maneuver during boost-phase. The missile's dynamics are linearized at a set of operating points for which angle of attack controllers are designed to cover an extended flight envelope. Then, angle of attack controllers are designed for this set of points, utilizing a pole-placement approach. The controllers' gains in the proposed configuration are computed from aerodynamic coefficients and design parameters in order to satisfy designer-chosen criteria. These design parameters are the closed-loop frequency, damping ratio, and time constant; these represent the characteristics of the control system. To cope with highly nonlinear and rapidly time varying dynamics during boost-phase, the global gain-scheduled controller is obtained by interpolating the controllers' gains over variations of the angle of attack, Mach number, and center of gravity. Simulation results show that the proposed autopilot design provides satisfactory performance and possesses good [ed: or "sufficient" or "excellent"] capabilities.