• Title/Summary/Keyword: Mesh generation

Search Result 525, Processing Time 0.023 seconds

A Pollution Adaptive Mesh Generation Algorithm Using Singular Shape Functions (특이 형상함수를 이용한 Pollution 적응 요소생성 알고리즘)

  • 유형선;장준환;편수범
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2001.04a
    • /
    • pp.110-118
    • /
    • 2001
  • In many areas of finite element analysis, elements with special properties are required to achieve maximal accuracy. As examples, we may mention infinite elements for the representation of spatial domain that extend to special and singular elements for modeling point and line singularities engendered by geomeric features such as reentrant corners and cracks. In this paper, we study on modified shape function representing singular properties and algorigthm for the pollution adaptive mesh generation. We will also show that the modified shape function reduces pollution error and local error.

  • PDF

Intelligent Forging Simulation Techniques and AFDEX (지능적 단조 시뮬레이션 기술과 AFDEX)

  • Joun, M.S.;Lee, M.C.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2008.05a
    • /
    • pp.225-229
    • /
    • 2008
  • We present an intelligent forging simulator AFDEX. The intelligent forging simulator is determined by the adaptive and optimal mesh generation technique and many intelligent application-oriented special functions which minimize the user-intervention during forging simulation. Of course, the solution accuracy should be optimized in the intelligent simulation. We have developed AFDEX to meet the requirement on intelligent simulation. Its characteristics are introduced with the help of typical application examples.

  • PDF

STUDY ON 3-D VIRTUAL REALITY FOR STEREOSCOPIC VISUALIZATION ON THE WEB (웹 환경에서의 입체적 가시화를 위한 3-D 가상현실 기법의 적용)

  • Lee, J.H.;Park, Y.C.;Kim, J.H.;Kim, B.S.
    • Journal of computational fluids engineering
    • /
    • v.16 no.1
    • /
    • pp.30-35
    • /
    • 2011
  • In this paper, our effort to apply 3-D Virtual Reality system for stereoscopic visualization of mesh data on the web is briefly described. This study is an extension of our previous and on-going research efforts to develop an automatic grid generation program specialized for wing mesh, named as eGWing. The program is developed by using JAVA programming language, and it can be used either as an application program on a local computer or as an applet in the network environment. In this research advancing layer method(ALM) augmented by elliptic smoothing method is used for the structured grid generation. And to achieve a stereoscopic viewing capability, two graphic windows are used to render its own viewing image for the left and right eye respectively. These two windows are merged into one image using 3D monitor and the viewers can see the mesh data visualization results with stereoscopic depth effects by using polarizing glasses. In this paper three dimensional mesh data visualization with stereoscopic technique combined with 3D monitor is demonstrated, and the current achievement would be a good start-up for further development of low-cost high-quality stereoscopic mesh data visualization system which can be shared by many users through the web.

Study on High Speed Routers(II)-Performance Analysis on Various Network Topology of STC104 (고속 라우터에 대한 고찰(II)-STC104의 망 구성에 따른 성능분석)

  • Lee, Hyo-Jong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.157-166
    • /
    • 2001
  • A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

  • PDF

Automated Finite Element Analyses for Structural Integrated Systems (통합 구조 시스템의 유한요소해석 자동화)

  • Chongyul Yoon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.37 no.1
    • /
    • pp.49-56
    • /
    • 2024
  • An automated dynamic structural analysis module stands as a crucial element within a structural integrated mitigation system. This module must deliver prompt real-time responses to enable timely actions, such as evacuation or warnings, in response to the severity posed by the structural system. The finite element method, a widely adopted approximate structural analysis approach globally, owes its popularity in part to its user-friendly nature. However, the computational efficiency and accuracy of results depend on the user-provided finite element mesh, with the number of elements and their quality playing pivotal roles. This paper introduces a computationally efficient adaptive mesh generation scheme that optimally combines the h-method of node movement and the r-method of element division for mesh refinement. Adaptive mesh generation schemes automatically create finite element meshes, and in this case, representative strain values for a given mesh are employed for error estimates. When applied to dynamic problems analyzed in the time domain, meshes need to be modified at each time step, considering a few hundred or thousand steps. The algorithm's specifics are demonstrated through a standard cantilever beam example subjected to a concentrated load at the free end. Additionally, a portal frame example showcases the generation of various robust meshes. These examples illustrate the adaptive algorithm's capability to produce robust meshes, ensuring reasonable accuracy and efficient computing time. Moreover, the study highlights the potential for the scheme's effective application in complex structural dynamic problems, such as those subjected to seismic or erratic wind loads. It also emphasizes its suitability for general nonlinear analysis problems, establishing the versatility and reliability of the proposed adaptive mesh generation scheme.

Toolpath Generation for Three-axis Round-end Milling of Triangular Mesh Surfaces (삼각망 곡면의 3축 라운드엔드밀 가공을 위한 공구경로 생성)

  • Chung, Yun-Chan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.26 no.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.

Effective Ionic Wind Generation Utilizing a Cylindrical Corona Discharge Electrode (금속관형 코로나 방전극을 적용한 효과적인 이온풍 발생)

  • Jung, Jae-Seung;Moon, Jae-Duk
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.3
    • /
    • pp.599-603
    • /
    • 2010
  • A point-mesh type corona system has been well used as a ionic wind blower. However this type corona system suffers from its lower ionic wind generation, because of its lower on-set and breakdown voltages of its very sharp needle point corona electrode. This means that the point corona electrode must act both as an effective ion-generator and a very higher electric field producer in the discharge airgap in order to generate higher ionic wind velocity. In this paper, a cylinder-mesh type discharge system as a ionic wind generator is proposed and investigated. The cylindrical corona electrode can produce many ions from its sharpened edge, and the corona on-set and breakdown voltages are very higher than those of the needle point corona electrode. As a result, this type cylindrical corona electrode might generate a higher ionic wind than the needle point corona electrode.

The Numerical Study of the Effect of Car Front Opening Area on the mean Flow in Engine Room (차 개구형상이 엔진룸내 유동에 미치는 영향에 관한 수치연구)

  • 류명석;이은준;구영곤
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.4 no.2
    • /
    • pp.158-165
    • /
    • 1996
  • The knowledge of air flow in an engine room has become more and more important in recent car design. The fluid flow in the engine compartment was investigated by numerical analysis. Due to the complex geometry of the engine compartment, mesh generation is a time-consuming job. In this research, the "ICEM" code was used to generate meshes by the Cartesian mesh model. The Reynolds-averaged Navier Stokes equations, together with the porous flow model for radiator and condenser, were solved. Computation was performed for the steady, incompressible, and high speed viscous flow, adopting the standard K-ε turbulence model. The "STAR-CD" code was used as a solver. The effect of car front openning area on the flow in engine room was also investigated.

  • PDF

A meshfree method based on adaptive refinement method and its application for deformation analysis (변형해석을 위한 적응적 세분화방법에 기초한 무요소법)

  • Han, Kyu-Taek
    • Design & Manufacturing
    • /
    • v.7 no.1
    • /
    • pp.34-39
    • /
    • 2013
  • The finite element method(FEM) presents some limitations when the mesh becomes highly distorted. For analysis of metal forming processes with large deformation, the conventional finite element method usually requires several remeshing operations due to severe mesh distortion. The new computational method developed in the recent years, usually designated by meshfree method, offers an attractive approach to avoid those time-consuming remeshing efforts. This new method uses a set of points to represent the problem domain with no need of an additional mesh. Also this new generation of computational method provides a higher rate of convergence than that of the conventional finite element methods. One of the promising applications of meshfree methods is the adaptive refinement for problems having multi-scale nature. In this study, an adaptive node generation procedure is proposed and also to illustrate the efficiency of proposed method, several numerical examples are presented.

  • PDF

An Efficient Robot Path Generation Using Delaunay Mesh (딜레노이 메시를 이용한 효율적인 로봇 경로 생성방법)

  • Noh, Sung-Woo;Ko, Nak-Yong;Kim, Kwang-Jin
    • The Journal of Korea Robotics Society
    • /
    • v.5 no.1
    • /
    • pp.41-47
    • /
    • 2010
  • This paper proposes a path planning method of a mobile robot in two-dimensional work space. The path planning method is based on a cell decomposition approach. To create a path which consists of a number of line segments, the Delaunay Triangulation algorithm is used. Using the cells produced by the Delaunay Triangulation algorithm, a mesh generation algorithm connects the starting position to the goal position. Dijkstra algorithm is used to find the shortest distance path. Greedy algorithm optimizes the path by deleting the path segments which detours without collision with obstacles.