• Title/Summary/Keyword: Polyhedral Mesh

Search Result 11, Processing Time 0.023 seconds

5-Axis Tool Path Generation from Offset Polyhedral Mesh (옵셋 다면체를 이용한 5축 가공경로 생성)

  • Kim Su-Jin;Yang Min-Yang
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.6 s.249
    • /
    • pp.678-683
    • /
    • 2006
  • In this paper, the 5-axis tool path that has been generated from the original surface is, newly generated from the offset polyhedral mesh. In this approach, the interference check between two solid models can be simplified to that of offset polyhedral mesh and axis line. The tool path computation and interference check based on the offset mesh is simpler and faster than that based on the original surface. But 5-axis tool path generation using this approach is able to apply only for ball endmill and still takes longer time than 3-axis tool path generation.

Parallel Generation of NC Tool Paths for Subdivision Surfaces

  • Dai Junfu;Wang Huawei;Qin Kaihuai
    • International Journal of CAD/CAM
    • /
    • v.4 no.1
    • /
    • pp.47-53
    • /
    • 2004
  • The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.

Development of Local Modification Functions for Edge Rounds on Shell Meshes (쉘 메쉬 모델의 모서리 라운드 탐색 및 수정 기능)

  • 이원경;이상헌
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.624-627
    • /
    • 2000
  • This paper describes a local modification capability on shell meshes, which can change a 'constant or variable radius of rounding for the s h q edges of the stamping die shoulder in the mesh. The algorithm consists of the followin_e three main steps; (1) the rounding area for sharp edges of a die shoulder are detected from the given shell mesh, (2) a rolling-ball surface with a given constant or variable radius is generated, which is contacti% with two incident face groups of the sharp edges, (3) the rounding area of the mesh is cut off, and a new mesh for the rolling-ball surface is generated and implanted into the gap. Owing to this rounding modification capability, CAE engineers can examine various cases based on the existing dies by scanning them to form polyhedral models and then changing radii of die shoulders for stamping process simulation.

  • PDF

Incomplete 2-manifold Mesh Based Tool Path Generation (불완전한 2차원다양체 메시기반 공추경로생성)

  • Lee Sung-gun;Kim Su-jin;Yang Min-yang;Lee Dong-yoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.3 s.234
    • /
    • pp.447-454
    • /
    • 2005
  • This paper presents a new paradigm for 3-axis tool path generation based on an incomplete 2-manifold mesh model, namely, an inexact polyhedron. When geometric data is transferred from one system to another system and tessellated for tool path generation, the model does not have any topological data between meshes and facets. In contrast to the existing polyhedral machining approach, the proposed method generates tool paths from an incomplete 2-manifold mesh model. In order to generate gouge-free tool paths, CL-meshes are generated by offsetting boundary edges, boundary vertices, and facets. The CL-meshes are sliced by machining planes and the calculated intersections are sorted, trimmed, and linked. The grid method is used to reduce the computing time when range searching problems arise. The method is fully implemented and verified by machining an incomplete 2-manifold mesh model.

Feature-based Topological Mesh Metamorphosis (위상 변환을 통한 특징 기반 메쉬 몰핑)

  • An, Min-Su;Lee, Seung-Yong
    • Journal of the Korea Computer Graphics Society
    • /
    • v.7 no.4
    • /
    • pp.1-8
    • /
    • 2001
  • 3D mesh metamorphosis (morphing) deals with two input polyhedral objects and generates an animation in which the source mesh gradually changes to the target through in-between meshes. The basic and common idea of previous mesh morphing techniques can be summarized as the construction and interpolation of a metamesh. However, an approach based on a metamesh has fundamental limitations of complicated in-between meshes and no topology (connectivity) changes in a metamorphosis. This paper presents a novel approach for 3D mesh morphing, which is not based on a metamesh and overcomes the limitations of previous work. The approach simultaneously interpolates the topology and geometry of input meshes. With the approach, an in-between mesh contains only the vertices from the source and target meshes. Since no additional vertices are introduced, the in-between meshes are much simpler than those generated by previous techniques.

  • PDF

Computational fluid dynamic simulation with moving meshes

  • Yun, Kiyun;Kim, Juhan;Yoon, Suk-Jin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.38 no.2
    • /
    • pp.101.2-101.2
    • /
    • 2013
  • We present a new computational fluid dynamic (CFD) simulation code. The code employs the moving and polyhedral unstructured mesh scheme, which is known as a superior approach to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for surfaces of every Voronoi cell to update the hydrodynamic states as well as to move former generated meshes. For the second-order accuracy, the MUSCL-Hancock scheme is implemented. To increase efficiency for generating Voronoi tessellation we also develop the incremental expanding method, by which the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We will discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

  • PDF

Periodic Mesh Generation for Composite Structures using Polyhedral Finite Elements (다면체 유한요소를 이용한 복합재 구조의 주기 격자망 생성)

  • Sohn, Dongwoo;Park, Jong Youn;Cho, Young-Sam;Lim, Jae Hyuk;Lee, Haengsoo
    • 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.

Numerical Analysis of the Gas Flow Distribution Characteristics in the Anode Flow Channel of Molten Carbonate Fuel Cell (MCFC) (용융탄산염 연료전지 Anode 유로 채널에서의 가스 유동 분포에 관한 수치해석적 연구)

  • Cho, Jun-Hyun;Ha, Tae-Hun;Kim, Han-Sang;Min, Kyoung-Doug;Park, Jong-Hoon;Chang, In-Gab;Lee, Tae-Won
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.33 no.11
    • /
    • pp.834-839
    • /
    • 2009
  • A three-dimensional computational fluid dynamics (CFD) analysis is performed to investigate flow characteristics in the anode channels and manifold of the internal reforming type molten carbonate fuel cell (MCFC). Considering the computational difficulties associated with the size and geometric complexity of the MCFC system, the polyhedral meshes that can reduce mesh connectivity problems at the intersection of the channel and the manifold are adopted and chemical reactions inside the MCFC system are not included. Through this study, the gas flow rate uniformity of the anode channels is mainly analyzed to provide basic insights into improved design parameters for anode flow channel design. Results indicate that the uniformity in flow-rate is in the range of ${\pm}$1% between the anode channels. Also, the mal-distributed inlet flow-rate conditions and the change in the size of the manifold depth have no significant effect on the flow-rate uniformity of the anode channels.

Numerical analysis of the gas flow distribution characteristics in the anode flow channel of the molten carbonate fuel cell (MCFC) (용융탄산염 연료전지 anode 유로 채널에서의 가스 유동 분포에 관한 수치해석적 연구)

  • Cho, Jun-Hyun;Ha, Tae-Hun;Kim, Han-Sang;Min, Kyoung-Doug;Park, Jong-Hoon;Chang, In-Gab;Lee, Tae-Won
    • Proceedings of the KSME Conference
    • /
    • 2008.11b
    • /
    • pp.3120-3124
    • /
    • 2008
  • A three-dimensional computational fluid dynamics (CFD) analysis is performed to investigate flow characteristics in the anode channels and manifold of the internal reforming type molten carbonate fuel cell (MCFC). Considering the computational difficulties associated with the size and geometric complexity of the MCFC system, the polyhedral meshes that can reduce mesh connectivity problems at the intersection of the channel and the manifold are adopted and chemical reactions inside the MCFC system are not included. Through this study, the gas flow rate uniformity of the anode channels is mainly analyzed to provide basic insights into improved design parameters for anode flow channel design. Results indicate that the uniformity in flow-rate is in the range of ${\pm}1%$ between the anode channels. Also, the mal-distributed inlet flow-rate conditions and the change in the size of the manifold depth have no significant effect on the flow-rate uniformity of the anode channels.

  • PDF

On Constructing NURBS Surface Model from Scattered and Unorganized 3-D Range Data (정렬되지 않은 3차원 거리 데이터로부터의 NURBS 곡면 모델 생성 기법)

  • Park, In-Kyu;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.3
    • /
    • pp.17-30
    • /
    • 2000
  • In this paper, we propose an efficient algorithm to produce 3-D surface model from a set of range data, based on NURBS (Non-Uniform Rational B-Splines) surface fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three steps: initial model approximation, hierarchical representation, and construction of the NURBS patch network. The mitral model is approximated by polyhedral and triangular model using K-means clustering technique Then, the initial model is represented by hierarchically decomposed tree structure. Based on this, $G^1$ continuous NURBS patch network is constructed efficiently. The computational complexity as well as the modeling error is much reduced by means of hierarchical decomposition and precise approximation of the NURBS control mesh Experimental results show that the initial model as well as the NURBS patch network are constructed automatically, while the modeling error is observed to be negligible.

  • PDF