• 제목/요약/키워드: Triangular Meshes

검색결과 103건 처리시간 0.027초

삼각 메쉬를 위한 기하학 스네이크 (Geometric Snakes for Triangular Meshes)

  • 이윤진;이승용
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제7권3호
    • /
    • pp.9-18
    • /
    • 2001
  • 삼각 메쉬의 특징점을 찾는 것은 메쉬 편집, 메쉬 몰핑, 메쉬 압축, 메쉬 신호처리 등 여러 가지 응용 분야에서 중요하게 사용된다. 본 논문에서는 삼각 메쉬의 특징점을 찾기 위한 방법으로 기하학 스네이크를 제시하였다. 기하학 스네이크는 영상 스네이크를 확장한 것으로, 사용자가 초기 위치를 정하면 에너지 함수를 최소화함으로써 가까이에 있는 특징점을 찾는다. 기하학 스네이크는 항상 메쉬 표면 위에서만 이동하여야 하므로 메쉬를 매개 변수화하여 스네이크를 이차원 상에 매핑된 메쉬상에서 이동시켰다. 스네이크를 특징점으로 이동시키기 위한 외부 에너지는 메쉬 표면의 노말 변화를 이용하여 계산하였다.

  • PDF

쾌속조형 시스템을 위한 3차원 기하학적 형상인 STL의 디지털 워터마킹 (A Digital Watermarking of 3D Geometric Model STL for Rapid Prototyping System)

  • 김기석;천인국
    • 한국멀티미디어학회논문지
    • /
    • 제5권5호
    • /
    • pp.552-561
    • /
    • 2002
  • 본 논문은 쾌속조형(rapid prototyping) 시스템에서 사용되며 3D 기하학적 형상을 가지는 STL 파일에 워터마크를 삽입하고 추출하는 방법에 관한 연구이다. 제안된 알고리즘은 3D 형상의 왜곡이 없도록 하기위해, 패싯의 법선 영역과 꼭지점 영역에 워터마크를 삽입한다. 워터마크 비트들은 법선의 위치와 꼭지점의 순서 정보를 이용하여 삽입된다 제안된 알고리즘은 패싯의 저장 순서에 대한 종속성이 없으며, 워터마크의 비가시성 (invisibility)을 충족한다. 제안된 알고리즘으로 3D 기하학적 형상에 워터마크를 삽입하고 추출하는 실험 결과들은 STL로 표현된 3D원형상에 영향을 주지 않고 워터마크의 삽입과 추출이 가능함을 보여준다.

  • PDF

적응요소 MLFMA를 이용한 유전체층을 가진 3차원 도체의 정전용량계산 (A Fast Capacitance Extraction Algorithm for Multiple 3-Dimensional Conductors with Dielectrics using Adaptive Triangular Mesh)

  • 김한;안창회
    • 한국전자파학회논문지
    • /
    • 제13권1호
    • /
    • pp.80-86
    • /
    • 2002
  • 본 논문에서는 유전체층을 가진 3차원 도체의 정전용량 계산을 위한 적응요소 MLFMA을 제안하였다. 고속화 알고리즘인 MLFMA와 더불어 높은 전하밀도를 가지는 영역에서 삼자요소를 세분화함으로써 효율적으로 요소를 분할하게 된다. 제안된 기법은 유전체 층위의 3차원 도체의 정전용량을 계산하는데 적용되어 균일한 요소에 의한 계산결과의 수렴보다 빠른 결과를 얻을 수 있었다. 또한, 3차원의 복잡한 구조를 가진 문제의 해석에 있어서도 과도한 추가계산시간을 요구하지 않으므로, 제안된 방법을 MLFMA의 장점에 부합되는 적절한 기법이라 할 수 있다.

딜러니 개선 알고리듬을 이용한 삼차원 구의 보로노이 곡면 삼각화 (Triangulation of Voronoi Faces of Sphere Voronoi Diagram using Delaunay Refinement Algorithm)

  • 김동욱
    • 산업경영시스템학회지
    • /
    • 제41권4호
    • /
    • pp.123-130
    • /
    • 2018
  • Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

2차 곡면 정합을 이용한 점진적 압축 기법 (Progressive Compression of 3D Triangular Meshes Using Quadratic Surface Fitting)

  • 고영준;안재균;이대연;김창수
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2010년도 추계학술대회
    • /
    • pp.143-144
    • /
    • 2010
  • 3차원 메쉬는 전송과 저장에 많은 저장 공간을 필요로 한다. 따라서 3차원 메쉬의 효과적인 전송 및 렌더링을 위해서는 3차원 객체에 대한 압축이 필수적이다. 이에 본 논문은 점진적 전송을 위한 기하 정보 압축 기법을 제안한다. 제안하는 알고리즘은 점진적 전송에서 각 레벨마다 추가되는 점의 기하 정보를 예측하는 효과적인 방법을 사용한다. 구체적으로 제안하는 기법은 상위 레벨의 점들을 이용하여 2차 곡면을 추정하고, 추정된 곡면을 통해 기하 정보를 예측 부호화한다. 실험 결과는 제안하는 알고리즘이 기하 정보 압축률을 향상시킬 수 있음을 보여준다.

  • PDF

박판성형을 위한 신속한 금형곡면의 수정 (Rapid Die Surface Modification for Sheet Metal Forming)

  • 유동진
    • 소성∙가공
    • /
    • 제16권7호
    • /
    • pp.538-548
    • /
    • 2007
  • In this paper, a novel approach which enables rapid die surface modification for sheet metal forming process is proposed. In this method an implicit surface which interpolates a given set of control points and displacement constraints is generated to compute the displacements at arbitrary points located on die surface. The proposed method does not depend on the underlying surface representation type and is affected neither by its complexity nor by its quality. In addition, the domain decomposition method is introduced in order to treat large surface model. The global domain of interest is divided into smaller domains where the problem can be solved locally. And then the local solutions are combined together to obtain a global solution. In order to verify the validity and effectiveness of the proposed method, various surface modifications are carried out fur three kinds of die surface model including polygonal surface composed of triangular and rectangular meshes, polynomial surface and NURBS surface.

켄치 상태에서 고온 초전도 한류기의 전자기적 거동 (Electromagnetic Behavior of High-Tc Superconducting Fault Current Limiters under the Quench State)

  • Hyo-Sang Choi
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제53권1호
    • /
    • pp.38-42
    • /
    • 2004
  • In this paper we analyzed the electromagnetic behavior of a superconducting fault current limiter (SFCL) under the quench state using FEM. The analysis model used in this work is 5.5 KVA meander-line type SFCLs which are currently developed by Superconductor Power System Lab in Korea Electric Power Research Institute. Meshes of 3,650 triangular elements were used in the analysis of this SFCL. Analysis results showed that the distribution of current density was concentrated to inner curved line in meander-line type SFCL and the maximum current density was 14.61 A/$m^2$ and also the maximum Joule heat was 2,030 W/$m^2$ in this region. We think that the new and the modified structure must be considered for an uniform distribution of the electromagnetic field.

비정렬 격자기법을 이용한 횡류팬(Cross-Flow Fan)의 비정상 유동해석 (NUMERICAL PREDICTION OF THE CROSS-FLOW FAN PERFORMANCE AND NOISE CHARACTERISTICS BY UNSTRUCTURED FLOW SOLVER ALGORITHM)

  • 조용;문영준
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1998년도 추계 학술대회논문집
    • /
    • pp.36-41
    • /
    • 1998
  • The cross-flow fan performance and its sound noise characteristics are predicted by computational methods. The unsteady incompressible Navier-Stokes equations in moving coordinates are solved by a SMAC method on unstructured triangular meshes, using a sliding mesh technique at the interface between the domain rotating with blades and the rest stationary part. The computationally predicted fan performance was favorably compared with experiment, and some numerical aspects of simulating the cross-flow fan are discussed. With the computed unsteady flow field, aeroacoustic sound noise of the fan is predicted by the Lighthill-Curie equation. The unsteady surface pressure fluctuations on stabilizer enables a prediction of BPF noise of the uniform pitch blade fan quite accurately. The aeroacoustic sound noise characteristics of both uniform and random pitch blade fans are also examined by SPL spectrum analysis.

  • PDF

Non-iterative Global Mesh Smoothing with Feature Preservation

  • Ji, Zhongping;Liu, Ligang;Wang, Guojin
    • International Journal of CAD/CAM
    • /
    • 제6권1호
    • /
    • pp.89-97
    • /
    • 2006
  • This paper presents a novel approach for non-iterative surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved by a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple and fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.

삼차원 직교 격자 생성을 위한 단면 커브를 이용한 옥트리 생성과 셀 절단 알고리듬 (Octree Generation and Clipping Algorithm using Section Curves for Three Dimensional Cartesian Grid Generation)

  • 김동훈;신하용;박세연;이일랑;권장혁;권오준
    • 한국CDE학회논문집
    • /
    • 제13권6호
    • /
    • pp.450-458
    • /
    • 2008
  • Recently, Cartesian grid approach has been popular to generate grid meshes for complex geometries in CFD (Computational Fluid Dynamics) because it is based on the non-body-fitted technique. This paper presents a method of an octree generation and boundary cell clipping using section curves for fast octree generation and elimination of redundant intersections between boundary cells and triangles from 3D triangular mesh. The proposed octree generation method uses 2D Scan-Converting line algorithm, and the clipping is done by parameterization of vertices from section curves. Experimental results provide octree generation time as well as Cut-cell clipping time of several models. The result shows that the proposed octree generation is fast and has linear relationship between grid generation time and the number of cut-cells.