• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.11-16
• /
• 2010

We present an efficient algorithm for rendering sweep surfaces using programmable graphics hardware. A sweep surface can be represented by a cross-section curve undergoing a spline motion. This representation has a simple matrix-vector multiplication structure that can easily be adapted to programmable graphics hardware. The data for the motion and cross-section curves are stored in texture memory. The vertex processor considers a pair of surface parameters as a vertex and evaluates its coordinates and normal vector with a single matrix multiplication. Using the GPU in this way is between 10 and 40 times as fast as CPU-based rendering.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.1
• /
• pp.63-70
• /
• 2009

Proposed in the paper is an algorithm to generate tool-path for sculptured surface machining. The proposed algorithm computes tool path by slicing offset triangular mesh, which is the CL-surface (Cutter Location surface). Since the offset triangular mesh includes invalid triangles and self-intersections, it is necessary to remove invalid portions. For the efficient removal of the invalid portions, we extended the sweep line algorithm. The extended sweep line algorithm removes invalid portions very efficiently, and it also considers various degeneracy cases including multiple intersections and overlaps. The proposed algorithm has been implemented and tested with various examples.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.2
• /
• pp.47-55
• /
• 1998

본 논문은 일반화된 원통(generalized cylinder)의 모양을 상호작용을 통해 조절할 수 있도록 하는 직접 제어 방법을 제시한다. 이 연구에서는 일반화된 원통을 단면을 이루는 B-스플라인 곡선이 B-스플라인 동작에 의해서 움직여 지나간 스윕(sweep) 곡면으로 해석한다. 만들어진 곡면은 주어진 단연 곡선들을 골격 곡선을 따라서 보간하는 NURBS 곡면으로 나타내어진다. 사용자가 일반화된 원통 곡면 위의한 점을 움직일 때, 단면의 모양과 해당하는 동작을 수정하여 일반화된 원통의 곡면이 사용자에 의해 움직여진 위치를 지나도록 변형시킨다. 곡면의 변형은 목표 추적 과정을 거쳐 이루어진다. 이 방법에 의해 구현된 시스템을 이용하여 실시간으로 일반화된 원통을 직접 제어를 통해 디자인 할 수 있다.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.4
• /
• pp.1-7
• /
• 2002

This paper presents a new approach for modeling human limbs shape from 3D scan data. Based on the cylindrical structure of limbs, the overall shape is approximated with a set of ellipsoids through ellipsoid fitting and interpolation of fit-ellipsoids. Then, the smooth domain surface representing the coarse shape is generated as the envelope surface of ellipsoidal sweep, and the fine details are reconstructed by constructing parametric displacement function on the domain surface. For fast calculation, the envelope surface is approximated with ellipse sweep surface, and points on the reconstructed surface are mapped onto the corresponding ellipsoid. We demonstrate the effectiveness of our approach for skeleton-driven body deformation.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.30 no.7 s.250
• /
• pp.603-611
• /
• 2006

This paper presents the response surface optimization method using three-dimensional Wavier-Stokes analysis to optimize the blade shape of an axial flow fan. Reynolds-averaged Wavier-Stokes equations with $k-{\epsilon}$ turbulence model are discretized with finite volume approximations using the unstructured grid. Regression analysis is used for generating response surface, and it is validated by ANOVA and t-statistics. Four geometric variables, i.e., sweep and lean angles at mean and tip respectively were employed to improve the efficiency. The computational results are compared with experimental data and the comparisons show generally good agreements. As a main result of the optimization, the total efficiency was successfully improved. Also, detailed effects of sweep and lean on the axial flow fan are discussed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1595-1598
• /
• 2003

이 논문은 질의와 검색 대상 객체가 모두 이동 객체인 경우, 즉 3 차원 폴리라인(polyline) 형태의 경로를 가지는 객체들 간의 연속(continuous) 최근접 질의 처리에 유용한 기법을 제안한다. 질의경로를 따라 객체를 탐색해가면서 질의에 대한 최근접 정보가 변하는 시점을 찾는 것이 목적인 연속 최근접 질의 처리는 전체 질의 경로에 올바른 최근접 정보 리스트를 제공하지만, 기존의 방법들은 검색 대상 객체가 동적인 경우에 적용되기에는 시간에 따라 움직이는 객체의 위치변화를 처리하지 못하고, 질의 시점과 대상 객체간의 시점을 연관시키기 어렵다는 문제점들을 가지고 있다. 따라서 이 논문에서는 데이터 객체들의 궤적 정보는 STR 트리로 유지하고, 질의 경로 세그먼트와 질의의 시간 인터벌에 포함되는 데이터 객체 세그먼트 모두에 대해 추출시간(sampling time) 선택, 스윕라인(sweep line) 적용, 위치 추정 함수 이용 등의 단계를 처리함으로써, 이 문제를 해결하고 질의 경로 전체에 정확한 최근접 객체 정보 리스트를 제공한다. 제안된 기법은 물류정보시스템, 국방정보시스템, 기상, 교통 등 시공간 이동 객체의 질의를 다루는 시스템에 적용할 수 있다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.11
• /
• pp.903-910
• /
• 2014

Electric fans, which consist of axial blades, are operated by the induction motor. In this paper, the objective of this study is the performance improvement of the base model fan using the design optimization. In order to aerodynamic analysis, computational simulations are performed using commercial tool ANSYS-CFX ver. 14.5. And k-${\omega}$ SST turbulence model is used for the CFD analysis. The design variables are set up as sweep and lean angles. Volumetric flow rate and torque of the fan blades are fixed to objective function. The optimized model is shown the increment of the volumetric flow rate and the reduction of the torque compared with the base model. The experimental procedure is followed KS C 9301. CFD results and experimental results are fairly well matched.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.27-40
• /
• 2015

Inferring firewall policy is to discover firewall policy by analyzing response packets as results of active probing without any prior information. However, a brute-force approach for generating probing packets is unavailable because the probing packets may be regarded as attack traffic and blocked by attack detection threshold of a firewall. In this paper, we propose a firewall policy inference method using an efficient probing algorithm which considers the number of source IP addresses, maximum probing packets per second and interval size of adjacent sweep lines as inference parameters to avoid detection. We then verify whether the generated probing packets are classified as network attack patterns by a firewall, and present the result of evaluation of the correctness by comparing original firewall policy with inferred firewall policy.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.40-46
• /
• 2016

Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.