• Title/Summary/Keyword: Delaunay triangulation method

Search Result 86, Processing Time 0.024 seconds

A Study on 2-Layered Image Tile Mosaics Preserving Details of the Source Image (원 영상의 세부 묘사를 유지하는 두 층 이미지 타일 모자이크 방법에 대한 연구)

  • Kang, Dong-Wann;Park, Young-Sup;Seo, Sang-Hyun;Yoon, Kyung-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.10
    • /
    • pp.1282-1295
    • /
    • 2006
  • This paper proposes a method of image tile mosaics to preserve detailed depiction of the source image. This method enhance the shortcoming of the previous mosaic methods that cannot express the detailed depiction because of the gap between tiles. Our method is implemented by the usage of image tiles to preserve detailed depiction of the source image, as well as the usage of 2-layered tiles to.eliminate the gap between tiles. The method suggested in this paper are composed of following process. First of all, the position of the upper layer tile is located through a centroidal voronoi diagram to which an edge avoidance technique is applied, and the position of the lower layer tile is calculated using Delaunay triangulation. Secondly, discover the size and direction field of the tile considering the relation between tiles. Thirdly, adopt a photomosaic technique to use the image tiles. At this time, the technique of multi-level indexing is used to accelerate the speed of image searching. Through above process, the gap between tiles is minimized against other methods and a mosaic image with a maximized detailed description is achieved.

  • PDF

Fast Triangulation of Terrain Data through Unique Point Extraction (특이점 추출을 통한 지형데이터의 빠른 삼각망 생성)

  • 전경훈;구자영
    • Korean Journal of Remote Sensing
    • /
    • v.19 no.6
    • /
    • pp.457-464
    • /
    • 2003
  • Triangulated irregular network is one of the most frequently used terrain modeling methods. It represents terrain precisely using only a small amount of data, and enables fast rendering of terrain. In this paper, ridges and valleys are extracted from the terrain, and used as a set of vertices for the construction of triangulated irregular network. An experiment shows the new method reduces the time for construction of the triangulated irregular network significantly with almost equal amount of induced error.

A Fast Processing Algorithm for Lidar Data Compression Using Second Generation Wavelets

  • Pradhan B.;Sandeep K.;Mansor Shattri;Ramli Abdul Rahman;Mohamed Sharif Abdul Rashid B.
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.1
    • /
    • pp.49-61
    • /
    • 2006
  • The lifting scheme has been found to be a flexible method for constructing scalar wavelets with desirable properties. In this paper, it is extended to the UDAR data compression. A newly developed data compression approach to approximate the UDAR surface with a series of non-overlapping triangles has been presented. Generally a Triangulated Irregular Networks (TIN) are the most common form of digital surface model that consists of elevation values with x, y coordinates that make up triangles. But over the years the TIN data representation has become an important research topic for many researchers due its large data size. Compression of TIN is needed for efficient management of large data and good surface visualization. This approach covers following steps: First, by using a Delaunay triangulation, an efficient algorithm is developed to generate TIN, which forms the terrain from an arbitrary set of data. A new interpolation wavelet filter for TIN has been applied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to 'modify' the point values (point coordinates for geometry) after the splitting. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the original UDAR data. The results show that this method can be used for significant reduction of data set.

EKF SLAM-based Camera Tracking Method by Establishing the Reference Planes (기준 평면의 설정에 의한 확장 칼만 필터 SLAM 기반 카메라 추적 방법)

  • Nam, Bo-Dam;Hong, Hyun-Ki
    • Journal of Korea Game Society
    • /
    • v.12 no.3
    • /
    • pp.87-96
    • /
    • 2012
  • This paper presents a novel EKF(Extended Kalman Filter) based SLAM(Simultaneous Localization And Mapping) system for stable camera tracking and re-localization. The obtained 3D points by SLAM are triangulated using Delaunay triangulation to establish a reference plane, and features are described by BRISK(Binary Robust Invariant Scalable Keypoints). The proposed method estimates the camera parameters from the homography of the reference plane when the tracking errors of EKF SLAM are much accumulated. Using the robust descriptors over sequence enables us to re-localize the camera position for matching over sequence even though the camera is moved abruptly.

Automation of Analysis for Stress Intensity Factor of 3-D Cracks (3차원 균열의 응력확대계수에 대한 해석의 자동화)

  • 이준성
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.496-500
    • /
    • 1997
  • This paper describes an automated system for analyzing the stress intensity factors(SIFs) of three-dimensional (3D) cracks. A geometry model, i.e.a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model by using the fuzzy knowledge processing. Nodes are generated by the bucketing method, and ten-noded quadratic tetrahedral solid elements are generated by the Delauuay triangulation techniques. The singular elements such that the mid-point nodes near crack fornt are shifted at the quarter-points are automatically placed along the 3D crack front. THe complete finite element (FE) model generated, i.e the mesh with material properties and boundary conditions is given to one of the commercial FE codes, and a stress analysis is performed. The SIFs are calculated using the displacement extrapolation method. To demonstrate practical performance of the present system, a semi- elliptical surface crack in a plate subjected to tension is solved.

  • PDF

Study of Structure Modeling from Terrestrial LIDAR Data (지상라이다 데이터를 이용한 구조물 모델링 기법 연구)

  • Lee, Kyung-Keun;Jung, Kyeong-Hoon;Kim, Ki-Doo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.8-15
    • /
    • 2011
  • In this paper, we propose a new structure modeling algorithm from 3D cloud points of terrestrial LADAR data. Terrestrial LIDAR data have various obstacles which make it difficult to apply conventional algorithms designed for air-borne LIDAR data. In the proposed algorithm, the field data are separated into several clusters by adopting the structure extraction method which uses color information and Hough transform. And cluster based Delaunay triangulation technique is sequentially applied to model the artificial structure. Each cluster has its own priority and it makes possible to determine whether a cluster needs to be considered not. The proposed algorithm not only minimizes the effects of noise data but also interactively controls the level of modeling by using cluster-based approach.

Stress Intensity Factor Analysis System for 3D Cracks Using Fuzzy Mesh (퍼지메쉬를 이용한 3차원 균열에 대한 응력확대계수 해석 시스템)

  • Lee, Joon-Seong;Lee, Eun-Chul;Choi, Yoon-Jong;Lee, Yang-Chang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.122-126
    • /
    • 2008
  • Integrating a 3D solid modeler with a general purpose FEM code, an automatic stress intensity factor analysis system of the 3D crack problems has been developed. A geometry model, i.e. a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model by using the fuzzy knowledge processing. Nodes are generated and quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. Finally, the complete finite element(FE) model generated, and a stress analysis is performed. This paper describes the methodologies to realize such functions, and demonstrates the validity of the present system.

Geometrically Nonlinear Analysis using Petrov-Galerkin Natural Element Method Natural Element Method (페트로프-갤러킨 자연요소법에 의한 기하하적 비선형 해석)

  • 이홍우;조진래
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.04a
    • /
    • pp.333-340
    • /
    • 2004
  • This paper deals with geometric nonlinear analyses using a new meshfree technique which improves the numerical integration accuracy. The new method called the Petrov-Galerkin natural element method (PGNEM) is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used for conventional natural element method called the Bubnov-Galerkin natural element method (BGNEM). But, unlike BGNEM, the test shape function is differently chosen from the trial shape function. In the linear static analysis, it is ensured that the numerical integration error of the PGNEM is remarkably reduced. In this paper, the PGNEM is applied to large deformation problems, and the accuracy of the proposed numerical technique is verified through the several examples.

  • PDF

A Study on the Adaptive Refinement Method for the Stress Analysis of the Meshfree Method (적응적 세분화 방법을 이용한 무요소법의 응력 해석에 관한 연구)

  • Han, Sang-Eul;Kang, Noh-Won;Joo, Jung-Sik
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2008.04a
    • /
    • pp.8-13
    • /
    • 2008
  • In this study, an adaptive node generation procedure in the radial point interpolation method is proposed. Since we set the initial configuration of nodes by subdivision of background cell, abrupt changes of inter-nodal distance between higher and lower error regions are unavoidable. This unpreferable nodal spacing induces additional errors. To obtain the smoothy nodal configuration, it's regenerated by local Delaunay triangulation algorithm This technique was originally developed to generate a set of well-shaped triangles and tetrahedra. To demonstrate the performance of proposed scheme, the results of making optimal nodal configuration with adaptive refinement method are investigated for stress concentration problems.

  • PDF

Tetrahedral Mesh Generation by Using the Advancing-Front Method and the Optimal Surface Triangular Mesh Generation Technique (전진경계기법과 최적 표면 삼각형 요소망 생성 기법을 이용한 사면체 요소망의 생성)

  • Lee M.C.;Joun M.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.2
    • /
    • pp.138-147
    • /
    • 2006
  • A systematic approach to tetrahedral element or mesh generation, based on an advancing-front method and an optimal triangular mesh generation technique on the surface, is presented in this paper. The possible internal nodes are obtained by the octree-decomposition scheme. The initial tetrahedral mesh system is constructed by the advancing-front method and then it is improved by the quality improvement processes including mesh swapping and nodal smoothing. The approach is evaluated by investigating the normalized length, the normalized volume, the dihedral angle and the normalized quality