• Korean Journal of Remote Sensing
• /
• v.34 no.6_1
• /
• pp.1067-1087
• /
• 2018

In a study for LiDAR data based building boundary extraction, usually dense point cloud was used to cluster building rooftop area and extract building outline. However, when we used DSM generated from stereo image matching to extract building boundary, it is not trivial to cluster building roof top area automatically due to outliers and large holes of point cloud. Thus, we propose a technique to extract building boundary semi-automatically from the DSM created from stereo images. The technique consists of watershed segmentation for using user input as markers and recursive MBR algorithm. Since the proposed method only inputs simple marker information that represents building areas within the DSM, it can create building boundary efficiently by minimizing user input.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.9
• /
• pp.425-435
• /
• 2017

Structural analysis is used not only for large enterprises, but also for small and medium sized ones, as a necessary procedure for strengthening the certification process for product delivery and shortening the time in the process from concept design to detailed design. Open-source solvers that can be used atlow cost differ from commercial solvers. If there is a problem with the input data, such as with the grid, errors or failures can occur in the calculation step. In this paper, we propose a pre- and post-processor that can be easily applied to the analysis of mechanical structural problems by using the existing structural analysis open source solver (Caculix, Code_Aster). In particular, we propose algorithms for analyzing different types of data using open source solvers in order to extract and generate accurate information,such as 3D models, grids and simulation conditions, and develop and apply information analysis. In addition, to improve the accuracy of open source solvers and to prevent errors, we created a grid that matches the solver characteristics and developed an automatic healing function for the grid model. Finally, to verify the accuracy of the system, the verification and utilization results are compared with the software used.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.1
• /
• pp.41-47
• /
• 2003

In this paper, a tetrahedral mesh generation algorithm which uses a grid based method for interior region and an advancing front method for outer surface region is proposed. In order to apply an advancing front method for outer region of an object, a new operator so called a hole operator has been developed to handle multiple shells. With this grid based approach in the interior region, more stable and uniform meshes can be constructed especially in the interior region.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.3
• /
• pp.113-122
• /
• 2007

The rapid growth of aerial survey and remote sensing technology has enabled the rapid acquisition of very large amounts of geographic data, which should be analyzed using real-time visualization technology. The level of detail(LOD) algorithm is one of the most important elements for realizing real-time visualization. We chose the triangulated irregular network (TIN) method to generate normalized digital elevation model(DEM) data. First, we generated TIN data using contour lines obtained from a two-dimensional(2D) digital map and created a 2D grid array fitting the size of the area. Then, we generated normalized DEM data by calculating the intersection points between the TIN data and the points on the 2D grid array. We used constrained Delaunay triangulation(CDT) and ray-triangle intersection algorithms to calculate the intersection points between the TIN data and the points on the 2D grid array in each step. In addition, we simulated a three-dimensional(3D) terrain model based on normalized DEM data with real-time visualization using a Microsoft Visual C++ 6.0 program in the DirectX API library and a quad-tree LOD algorithm.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.4
• /
• pp.239-245
• /
• 2014

Finite element modeling of composite structures may be cumbersome due to complex distributions of reinforcements. In this paper, an efficient scheme is proposed that can generate periodic meshes for the composite structures. Regular meshes with hexahedral finite elements are first prepared, and the elements are then trimmed to fit external surfaces of reinforcements in the composite structures. The trimmed hexahedral finite elements located at interfaces between the matrix and the reinforcements correspond to polyhedral finite elements, which allow an arbitrary number of nodes and faces in the elements. Because the trimming process is consistently conducted by means of consistent algorithms, the elements of the reinforcements are automatically compatible with those of the matrices. With the additional consideration of periodicity of reinforcements in a representative volume element(RVE), the proposed scheme provides periodic meshes in an efficient manner, which are compatible for each pair of periodic boundaries of the RVE. Therefore, periodic boundary conditions for the RVE are enforced straightforwardly. Numerical examples demonstrate the effectiveness of the proposed scheme for finite element modeling of complex composite structures.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.4
• /
• pp.275-283
• /
• 2013

In this paper, the structural optimum design method of composite rotor blade cross-section was investigated with the genetic algorithm. An auto-mesh generation program was developed for iterative calculations of optimum design, and stresses in the blade cross-section were analyzed by VABS (variational asymptotic beam sectional analysis) program. Minimum mass of rotor blade was defined as an object function, and stress failure index, center mass and blade minimum mass per unit length were chosen as constraints. Finally, design parameters such as the thickness and layup angles of a skin, and the thickness, position and width of a torsion box were determined through the structural optimum design method of composite rotor blade cross-section presented in this paper.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.7
• /
• pp.716-726
• /
• 2010

In this research, design optimization of an aircraft wing has been performed using the fully automated Multidisciplinary Design Optimization (MDO) framework, which integrates aerodynamic and structural analysis considering nonlinear structural behavior. A computational fluid dynamics (CFD) mesh is generated automatically from parametric modeling using CATIA and Gambit, followed by an automatic flow analysis using FLUENT. A computational structure mechanics (CSM) mesh is generated automatically by the parametric method of the CATIA and visual basic script of NASTRAN-FX. The structure is analyzed by ABAQUS. Interaction between CFD and CSM is performed by a fully automated system. The Response Surface Method (RSM) is applied for optimization, helping to achieve the global optimum. The optimization design result demonstrates successful application of the fully automated MDO framework.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.3
• /
• pp.229-237
• /
• 2008

In this research, a MDO(multi-disciplinary design optimization) framework, which integrates aerodynamic and structural analysis to design an aircraft wing, is constructed. Whole optimization process is automated by a parametric-modeling approach. A CFD mesh is generated automatically from parametric modeling of CATIA and Gridgen followed by automatic flow analysis using Fluent. Finite element mesh is generated automatically by parametric method of MSC.Patran PCL. Aerodynamic load is transferred to Finite element model by the volume spline method. RSM(Response Surface Method) is applied for optimization, which helps to achieve global optimum. As the design problem to test the current MDO framework, a wing weight minimization with constraints of lift-drag ratio and deflection of the wing is selected. Aspect ratio, taper ratio and sweepback angle are defined as design variables. The optimization result demonstrates the successful construction of the MDO framework.

• 한국전산유체공학회:학술대회논문집
• /
• 2010.05a
• /
• pp.335-340
• /
• 2010

In this paper development of an automatic grid generation program for flow field calculation around 3D wing is described and its application is also introduced. The program is developed by using JAVA programming language and a graphic library, JOGL, and it can be usee either as an application program on a local computer or as a applet in the network environment. Currently, The program provides NACA series 4-digit airfoils as the wing cross-section shape and it offers a non-complicated GUI program which can easily generate structured grids for wings based on user's parameter input. Grid generated by the program can be selected as one of two types; O-type and C-type. In this research advancing layer method(ALM) augmented by elliptic smoothing method is used for the FLUENT. It is shown that by using current program high-quality structured grids around 3D wings can be easily generated, and typical grid generation results and flow solutions are demonstrated. Study on effects of geometric parameters on flow field is also tried by changing major wing parameters such as incidence angle type of wing-tip and sweepback angle.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.514-526
• /
• 2004

Microarray is a new technique for gene expression experiment, which has gained biologist's attention for recent years. This technology enables us to obtain hundreds and thousands of expression of gene or genotype at once using microarray Since it requires manual work to analyze patterns of gene expression, we want to develop an effective and automated tools to analyze microarray image. However it is difficult to analyze DNA chip images automatically due to several problems such as the variation of spot position, the irregularity of spot shape and size, and sample contamination. Especially, one of the most difficult problems in microarray analysis is the block and spot addressing, which is performed by manual or semi automated work in all the commercial tools. In this paper we propose a new algorithm to address the position of spot and block using a new concept of regular structure grid searching. In our algorithm, first we construct maximal I-regular sequences from the set of input points. Secondly we calculate the rotational angle and unit distance. Finally, we construct I-regularity graph by allowing pseudo points and then we compute the spot/block address using this graph. Experiment results showed that our algorithm is highly robust and reliable. Supplement information is available on http://jade.cs.pusan.ac.kr/~autogrid.