• Title/Summary/Keyword: Mesh smoothing

Search Result 62, Processing Time 0.022 seconds

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.

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.

A Study on the Effecient Mesh Generation for Finite Element Analysis of Electric Machinery (전기기기의 유한 요소 해석을 위한 효율적인 요소 생성에 관한 연구)

  • Kim, Jin-Tae;Jeong, Tae-Gyeong;Kim, Hyeong-Seok
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.48 no.4
    • /
    • pp.174-181
    • /
    • 1999
  • To obtain more accurate result in the finite element analysis for electric machinery, it is important to have a mesh being of good quality. This paper describes a new technique of mesh generation for the finite element method. When the list of points defining the region of analysis is given, an appropriate distribution of interior points is generated first. Secondly the points are connected to from the trianlges. Finally the connectivity data are used to reposition the interior points using Laplacian smoothing and mesh relaxation technique. In this paper, a mesh searching technique of Lawson which modifies the start mesh is proposed in addition to the above three steps. This algorithm is simple and produces the meshes being of good quality with high speed in comparison with the existing one.

  • PDF

Delaunay mesh generation technique adaptive to the mesh Density using the optimization technique (최적화 방법을 이용한 Delaunay 격자의 내부 격자밀도 적응 방법)

  • Hong J. T.;Lee S. R.;Park C. H.;Yang D. Y.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2004.10a
    • /
    • pp.75-78
    • /
    • 2004
  • A mesh generation algorithm adapted to the mesh density map using the Delaunay mesh generation technique is developed. In the finite element analyses of the forging processes, the numerical error increases as the process goes on because of discrete property of the finite elements or severe distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical discretization error will be highly increased. However, it is too time consuming to use a uniformly fine mesh in the whole domain to reduce the expected numerical error. Therefore, it is necessary to construct locally refined mesh at the region where the error is concentrated such as at the die corner. In this study, the point insertion algorithm is used and the mesh size is controlled by moving nodes to optimized positions according to a mesh density map constructed with a posteriori error estimation. An optimization technique is adopted to obtain a good position of nodes. And optimized smoothing techniques are also adopted to have smooth distribution of the mesh and improve the mesh element quality.

  • PDF

Noise Smoothing using the 2D/3D Magnitude Ratio of Mesh Data (메쉬 데이터의 2D/3D 면적비를 이용한 잡음 평활화)

  • Hyeon, Dae-Hwan;WhangBo, Taeg-Keun
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.473-482
    • /
    • 2009
  • Reconstructed 3D data from computer vision includes necessarily a noise or an error. When these data goes through a mesh process, the different 3D mesh data from original shape comes to make by a noise or an error. This paper proposed the method that smooths a noise effectively by noise analysis in reconstructed 3D data. Because the proposed method is smooths a noise using the area ratio of the mesh, the pre-processing of unusable mesh is necessary in 3D mesh data. This study detects a peak noise and Gaussian noise using the ratio of 3D volume and 2D area of mesh and smooths the noise with respect of its characteristics. The experimental results using synthetic and real data demonstrated the efficacy and performance of proposed algorithm.

  • PDF

Extension of Topological Improvement Procedures for Triangular Meshes (삼각격자에 대한 위상학적 개선과정의 확장)

  • Maeng, Ju-Seong;Han, Seok-Yeong;Choe, Hyeong-Il
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.25 no.6
    • /
    • pp.853-859
    • /
    • 2001
  • This paper describes the extended topological clean up procedures to improve the quality of unstructured triangular meshes. As a postprocessing step, topological improvement procedures are applied both for elements that are interior to the mesh and for elements connected to the boundary and then Laplacian-like smoothing is used by default. Previous clean up algorithms are limited to eliminate the nodes of degree 3,4,8,9,10 and pairs of nodes of degree 5. In this study, new clean up algorithms which minimize the triple connection structures combined with degree 5 and 7 (ie ; 5-7-5, 7-7-5, 7-5-7 etc) are added. The suggested algorithms are applied to two example meshes to demonstrate the effectiveness of the approach in improving element quality in a finite element mesh.

Finite Element Mesh Generation from 3D Laser Scanned Data (3차원 레이저 스캐닝 점 좌표 데이터로부터 CAE 유한 요소 메쉬 생성 알고리즘 개발)

  • Jarng S.S.;Yang H.J.;Lee J.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.1
    • /
    • pp.70-75
    • /
    • 2005
  • A 3D solid element mesh generation algorithm was newly developed. 3D surface points of global rectangular coordinates were supplied by a 3D laser scanner. The algorithm is strait forward and simple but it generates mixed solid elements such as hexagonal, pyramid and prism types. Then, the surface triangular or rectangular elements were generated from the solid elements. The key of the algorithm is elimination of elements and 3D adaptive surface smoothing using given 3D surface point data.

An ALE Finite Element Method for Baffled Fuel Container in Yawing Motion

  • Cho, Jin-Rae;Lee, Hong-Woo;Yoo, Wan-Suk;Kim, Min-Jeong
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.3
    • /
    • pp.460-470
    • /
    • 2004
  • A computational analysis of engineering problems with moving domain or/and boundary according to either Lagrangian or Eulerian approach may encounter inherent numerical difficulties, the extreme mesh distortion in the former and the material boundary indistinctness in the latter. In order to overcome such defects in classical numerical approaches, the ALE(arbitrary Lagrangian Eulerian) method is widely being adopted in which the finite element mesh moves with arbitrary velocity. This paper is concerned with the ALE finite element formulation, aiming at the dynamic response analysis of baffled fuel-storage container in yawing motion, for which the coupled time integration scheme, the remeshing and smoothing algorithm and the mesh velocity determination are addressed. Numerical simulation illustrating theoretical works is also presented.

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.

Parametric Blending of Hole Patches Based on Shape Difference (형상 차이 기반 홀 패치의 파라미트릭 블렌딩 기법)

  • Park, Jung-Ho;Park, Sanghun;Yoon, Seung-Hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.26 no.3
    • /
    • pp.39-48
    • /
    • 2020
  • In this paper, we propose a new technique for filling holes in triangular mesh. First, arbitrary shaped holes are detected. Second, source and target hole patches are generated through triangulation, refinement, fairing, and smoothing. Finally, the shape difference between the two patches is analyzed and a patch with enhanced features is obtained through blending between patches. The effectiveness of the proposed technique is demonstrated by applying the hole filling technique to the triangular mesh model with various shaped holes.