• Title/Summary/Keyword: triangle mesh

Search Result 82, Processing Time 0.022 seconds

Simulation of Stable Cloth on Triangular Mesh via LOD-Based Bending Springs on Strain-Based Dynamics

  • Jong-Hyun Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.9
    • /
    • pp.73-79
    • /
    • 2023
  • This paper describes a level of detail (LOD) based bending spring structure and damping technique that can reliably represent strain-based dynamics (SBD) on a triangular mesh. SBD models elastic energy using strain instead of energy based on the edge length of a triangular mesh. However, when a large external force occurs, the process of calculating the elastic energy based on edges results in a degenerate triangle, which stretches in the wrong direction because it calculates an unstable strain. In this paper, we introduce an LOD-based bending spring generation and energy calculation method that can efficiently handle this problem. As a result, the technique proposed in this paper can reliably and efficiently handle SBD based on bending springs, which can provide a stable representation of cloth simulation.

An anisotropic mesh refinement for an unstructured finite volume method (비정렬 유한 체적법을 위한 비등방 격자 미세화 기법)

  • Lee K. S.;Baek J. H.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2004.03a
    • /
    • pp.77-82
    • /
    • 2004
  • A new anisotropic mesh refinement method is proposed. The new method is based on a simple second order interpolation error indicator. Therefore, it is methodologically direct and intuitive as compared with traditional anisotropic refinement strategies. Moreover, it does not depend on the mesh type. The error indicator is face-wisely calculated for all faces in a mesh and the cell refinement type is determined by the configuration of face markings with a given threshold. For the sake of simplicity, an application for a poisson equation on a triangle mesh is considered. The error field and resultant mesh refinement pattern are compared and effects of the threshold selection are discussed. Applying anisotropic refinement with various thresholds, we observed higher convergence rates than those in the uniform refinement cases.

  • PDF

A New Indirct Quadrilateral Mesh Generation Scheme from Background Triangular Mesh (삼각형 배경 요소를 이용한 새로운 사각형 요소망 생성법)

  • Kwon K.Y.;Park J.M.;Lee B.C.;Chae S.W.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.2
    • /
    • pp.107-114
    • /
    • 2006
  • A new quadrilateral mesh generation technique from an existing triangle mesh is proposed in this paper. The proposed method is based on advancing front method and zero-thickness layer. Beginning with an initial triangular mesh, boundary triangular elements are removed and quadrilateral elements with zero thickness are generated. A quality of quadrilateral elements is improved during a mesh smoothing process. Until all initial triangular elements are removed, this procedure is repeated. Sample meshes are constructed to demonstrate the mesh generation capability of proposed algorithm.

Nodal method for handling irregularly deformed geometries in hexagonal lattice cores

  • Seongchan Kim;Han Gyu Joo;Hyun Chul Lee
    • Nuclear Engineering and Technology
    • /
    • v.56 no.3
    • /
    • pp.772-784
    • /
    • 2024
  • The hexagonal nodal code RENUS has been enhanced to handle irregularly deformed hexagonal assemblies. The underlying RENUS methods involving triangle-based polynomial expansion nodal (T-PEN) and corner point balance (CPB) were extended in a way to use line and surface integrals of polynomials in a deformed hexagonal geometry. The nodal calculation is accelerated by the coarse mesh finite difference (CMFD) formulation extended to unstructured geometry. The accuracy of the unstructured nodal solution was evaluated for a group of 2D SFR core problems in which the assembly corner points are arbitrarily displaced. The RENUS results for the change in nuclear characteristics resulting from fuel deformation were compared with those of the reference McCARD Monte Carlo code. It turned out that the two solutions agree within 18 pcm in reactivity change and 0.46% in assembly power distribution change. These results demonstrate that the proposed unstructured nodal method can accurately model heterogeneous thermal expansion in hexagonal fueled cores.

An effective filtering for noise smoothing using the area information of 3D mesh (3차원 메쉬의 면적 정보를 이용한 효과적인 잡음 제거)

  • Hyeon, Dae-Hwan;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.2 s.314
    • /
    • pp.55-62
    • /
    • 2007
  • This paper proposes method to get exquisite third dimension data removing included noise by error that occur in third dimension reconstruction through camera auto-calibration. Though reconstructing third dimension data by previous noise removing method, mesh that area is wide is happened problem by noise. Because mesh's area is important, the proposed algorithm need preprocessing that remove unnecessary triangle meshes of acquired third dimension data. The research analyzes the characteristics of noise using the area information of 3-dimensional meshes, separates a peek noise and a Gauss noise by its characteristics and removes the noise effectively. We give a quantitative evaluation of the proposed preprocessing filter and compare with the mesh smoothing procedures. We demonstrate that our effective preprocessing filter outperform the mesh smoothing procedures in terms of accuracy and resistance to over-smoothing.

Volume Conserving Mesh Simplification Using Face Constriction (면 축약 방식을 이용한 체적 보존 메쉬 간략화)

  • Lee, Jun-Young;Jang, Tae-Jeong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.5
    • /
    • pp.87-96
    • /
    • 2005
  • In this paper, a mesh simplification algorithm using face constriction is proposed which considers the conservation of the volume of a 3D model. The face constriction method replaces three vertices of the candidate triangle with a new vertex, removing four faces at once. We propose a modified method, compensating an existing method, of considering curvature in the decision of the removing order of triangles. We also propose a method of determining a new vertex replacing the candidate triangle, which reflects curvature difference of the three surrounding areas of the three vertices of the triangle, while conserving the volume. It is shown by simulation that the proposed method conserves the volume and shows good constriction performance comparable to the other methods.

Mesh topological form design and geometrical configuration generation for cable-network antenna reflector structures

  • Liu, Wang;Li, Dong-Xu;Jiang, Jian-Ping
    • Structural Engineering and Mechanics
    • /
    • v.45 no.3
    • /
    • pp.411-422
    • /
    • 2013
  • A well-designed mesh shape of the cable net is of essential significance to achieve high performance of cable-network antenna reflectors. This paper is concerned with the mesh design problem for such antenna reflector structure. Two new methods for creating the topological forms of the cable net are first presented. Among those, the cyclosymmetry method is useful to generate different polygon-faceted meshes, while the topological mapping method is suitable for acquiring triangle-faceted meshes with different mesh grid densities. Then, the desired spatial paraboloidal mesh geometrical configuration in the state of static equilibrium is formed by applying a simple mesh generation approach based on the force density method. The main contribution of this study is that a general technical guide for how to create the connectivities between the nodes and members in the cable net is provided from the topological point of view. With the new idea presented in this paper, multitudes of mesh configurations with different net patterns can be sought by a certain rule rather than by empiricism, which consequently gives a valuable technical reference for the mesh design of this type of cable-network structures in the engineering.

2D Lower Body Flat Pattern of the Women in Their Twenties Using 3D Scan Data (3차원 인체 형상을 이용한 20대 여성의 하반신 전개패턴에 관한 연구)

  • Yoon, Mi-Kyung;Nam, Yun-Ja;Choi, Kyeng-Mi
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.31 no.5 s.164
    • /
    • pp.692-704
    • /
    • 2007
  • Recently, Basic patterns with excellent body fitness and automation availability are required to be developed in order to automate the patterns of women's clothes. In this study, this reference points, reference lines and segments were fixed onto 3D scan data for the lower body the women in their twenties, they were directly spread out to be 2D flat pattern to facilitate development into the design of slacks adhered closely to the human body such as special and highly-functional clothes, and then slacks 2D pattern was developed for the purpose of seeking scientific approach to the development into basic form slacks and 3d emotional pattern. For conversion of 3D pattern into 2D flat pattern, reference points and segments were created by using Rapid Form of 3D shape analysis software, and triangle mesh of the body surface of the created shape was developed with Auto CAD 2005. The correspondence between slacks and human body was examined by the fixation of major reference lines. Specially, the wearing characteristics of slacks were considered by the fixation of side lines in consideration of posture. As a result of using the way of development to constantly maintain the length while 3D triangle mesh is converted into 2D flat mesh, the shape was shown to be excellently reproduced, and the area of flat pattern was increased compared to the shape of parting plane. Also, the sunk-in curve like the brief line of front crotch length needed a cutting line when it was closely adhered, when mesh was overlapped, and the pattern area was smaller compared to the actual shape.

Development of General-purpose Software for 2D Hydraulic Analysis Analysis(RAMS) (2차원 수리해석을 위한 범용 소프트웨어(RAMS) 개발)

  • Goh, Tae-Jin;Jang, Hyung-Sang;Kim, Do-Hun;Kim, Eu-Gene
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2007.05a
    • /
    • pp.423-427
    • /
    • 2007
  • 현재까지 하천의 흐름, 유사이동, 수질해석을 위해서는 외국에서 개발된 소프트웨어를 주로 사용해 오고 있었다. 학술 분야에서는 국내의 모형들이 연구되어졌지만 그에 따른 GUI나 가시화 시스템에 대한 실용화는 거의 이루어지지 못하였다. 본 연구에서는 범용 2차원 하천 흐름, 수질, 유사이동 해석을 위한 GUI 및 가시화 시스템(이하 RAMS, River Analysis and Modeling System)을 개발하여, 하상변동 및 오염물 이송확산에 미치는 수리학적 영향을 규명할 수 있도록 하였다. RAMS는 크게 mesh generator, 해석 모형의 입력 GUI 모듈, 입출력 파일 생성 모듈, 그리고 모의 결과의 가시화 시스템 등으로 이루어져 있다. Mesh generator는 지형자료(이미지 또는 DXF 파일)를 백그라운드 이미지로 가져올 수 있으며, 삼각형 노드와 사각형 노드를 지원한다. 또한 thin triangle들을 제거하는 기능, 선택된 요소(elements)를 제거하는 기능, triangle들을 서로 병합하여 사각형 요소를 만드는 기능, mesh의 renumbering 기능 등을 구현하였다. 특히 사용자가 잘못 생성한 요소들을 바로 이전 상태로 환원하는 undo/redo 기능을 구현하여 능률적인 mesh 생성이 가능하다. 해석 모형의 입력 GUI 모듈에는 각 해석 모형(흐름, 수질, 유사이동)에 특화된 GUI를 설계하여 사용자는 보다 친숙한 환경에서 편리하게 자료를 입력할 수 있다. 입출력 파일 생성 모듈에서는 사용자가 GUI를 통해 입력한 자료를 파일로 변환하여 즉각적으로 모의를 수행하며, 그 출력 파일을 읽어 모의 결과를 자동적으로 가시화한다. 모의 결과의 가시화 시스템에서는 수많은 모의 결과를 체계화하여 등고선 및 화살표 등으로 표현하며, time step 별 결과를 바로 확인할 수 있다. 또한 애니메이션 기능을 구현하여 사용자가 원하는 구간의 time step에서의 모의 결과를 연속적으로 볼 수 있으며, 이 애니메이션을 AVI 파일로 변환하여 다른 동영상 프로그램에서도 재생할 수 있다. 본 연구에서 개발한 RAMS를 이용하여 하천 설계 시 그 공학적 근거를 제시하고, 국내 실정에 맞는 국산 소프트웨어를 제공함으로써 하천의 흐름, 수질, 유사이동 해석에 의한 하천의 수리학적 거동을 보다 편리하고 정확하게 모의할 수 있을 것으로 기대된다.

  • PDF

A Compact and Efficient Polygonal Mesh Representation (간결하고 효율적인 폴리곤 메쉬의 표현 구조)

  • Park S. K.;Lee S. H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.294-305
    • /
    • 2004
  • Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.