• Title/Summary/Keyword: Delaunay Triangulation Method

Search Result 87, Processing Time 0.022 seconds

An Efficient Triangular Mesh Generation Algorithm using Domain-wise Hash Structure (영역기반 해쉬구조를 이용한 효율적 삼각형 자동 요소망 생성 알고리듬 개발)

  • Kim, Tae-Joo;Cho, Jin-Yeon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.32 no.9
    • /
    • pp.41-48
    • /
    • 2004
  • In this work, a domain-wise hash structure is developed for efficient data handling, and by using the developed domain-wise hash structure, an automatic triangular mesh generation algorithm is proposed. To generate the optimal nodal points and triangles efficiently, the advancing layer method and Delaunay triangulation method are utilized. To investigate the performance of the proposed algorithm, benchmarking tests are carried out for various models including convex, concave and complicated shapes through the developed object oriented C++ mesh generation code.

Development of the Fuzzy-Based System for Stress Intensity Factor Analysis

  • Lee, Joon--Seong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.255-260
    • /
    • 2002
  • This paper describes a fuzzy-based 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-coded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. The singular elements such that the mid-point nodes near crack front are shifted at the quarter-points, and these are automatically placed along the 3D crack front. The complete finite element(FE) model is generated, and a stress analysis is performed. The SIFs are calculated using the displacement extrapolation method. To demonstrate practical performances of the present system, semi-elliptical surface cracks in a inhomogeneous plate subjected to uniform tension are solved.

Fingerprint Authentication Based on Minutiae Quandrangle Defined by Neighboring Two Delaunay Triangles (이웃한 두 Delaunay 삼각형이 만드는 특징점 사각형에 기반한 지문 인증)

  • 차순백;조상현;성효경;최홍문
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.721-724
    • /
    • 2000
  • This paper presents fingerprint authentication method based on minutiae quadrangle definded by neighboring two Delaunay triangles. In this method, we first make minutiae triangle through Delaunay triangulation which adaptively connect neighboring minutiae according to the local minutiae density distribution, and then use feature vectors in authentication which is extracted from the minutiae quadrangle formed by neighboring two minutiae triangles. This prevents the degradation of matching ratio caused by the errors in image processing or local deformation of the fingerprint, and we can authenticate more discriminately as this method reflects wider local area's topological features than the features extracted from the individual minutiae triangles. To evaluate the proposed algorithm's performance, experiment are conducted on 120 fingerprints, of which size is 256 ${\times}$ 364 with 500dpi resolution. Robust authentications are possible with low FRR.

  • PDF

Efficient Construction of Emergency Network Using Delaunay Triangulation (들로네 삼각망을 활용한 효과적인 긴급 연락망 구성)

  • Kim, Chae-Kak;Kim, In-Bum;Kim, Soo-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.81-90
    • /
    • 2014
  • For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.

Point Pattern Matching Algorithm Using Unit-Circle Parametrization

  • Choi, Nam-Seok;Lee, Byung-Gook;Lee, Joon-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.825-832
    • /
    • 2010
  • This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

Objective Quality Assessment for Stitched Image and Video (스티칭 영상의 객관적 영상화질의 평가 방법)

  • Billah, Meer Sadeq;Tuan, Thai Thanh;Ahn, Heejune
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2017.11a
    • /
    • pp.218-220
    • /
    • 2017
  • Recently, stitching techniques are used for obtaining wide FOV, e.g., panorama contents, from normal cameras. Despite many proposed algorithms, the no objective quality evaluation method is developed, so the comparison of algorithms are performed only in subjective way. The paper proposes a 'Delaunay-triangulation based objective assessment method' for evaluating the geometric and photometric distortions of stitched or warped images. The reference and target images are segmented by Delaunay-triangulation based on matched points between two images, the average Euclidian distance is used for geometric distortion measure, and the average or histogram of PSNR for photometric measure. We shows preliminary results with several test images and stitching methods for demonstrate the benefits and application.

  • PDF

Development of Automated J-Integral Analysis System for 3D Cracks (3차원 J적분 계산을 위한 자동 해석 시스템 개발)

  • 이준성
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.7
    • /
    • pp.74-79
    • /
    • 2000
  • Integrating a 3D solid modeler with a general purpose FEM code, an automatic nonlinear 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 by the bucketing method, and ten-noded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. The complete finite element(FE) model generated, and a stress analysis is performed. In this system, burden to analysts fur introducing 3D cracks to the FE model as well as fur estimating their fracture mechanics parameters can be dramatically reduced. This paper describes the methodologies to realize such functions, and demonstrates the validity of the present system.

  • PDF

STL 포맷의 구멍 오류 수정을 위한 삼각형 분할법 적용에 관한 연구

  • 손영지;조연상;전언찬
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.889-893
    • /
    • 1995
  • This paper verified error of STL file and presented a new application of reformed division method for reducing to appeared error by using Delaunay triangulation method that used to modify error of verified data. First, it is analyzed each vertices in hole error and classified follow case that is 1. case of plan or slope, 2. case of edge, 3. case of apex and 4. case of rapid curve, and reduced volume tolerance between original model and converted model after convert STL file.

  • PDF

Behavior Control Algorithm of Swarm Robots to Maintain Network Connectivity (네트워크 연결성 유지를 위한 군집 로봇의 행동 제어 알고리즘)

  • Kim, Jong Seon;Jeong, June Young;Ji, Sang Hoon;Joo, Young Hoon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.12
    • /
    • pp.1132-1137
    • /
    • 2013
  • In swarm robot systems, it is vital to maintain network connectivity to ensure cooperative behavior between robots. This paper deals with the behavior control algorithm of the swarm robots for maintaining network connectivity. To do this, we divide swarm robots into search-robots, base-robots, and relay-robots. Using these robots, we propose behavior control algorithm to maintain network connectivity. The behavior control algorithms to maintain network connectivity are proposed for the local path planning using virtual force and global path planning using the Delaunay triangulation, respectively. Finally, we demonstrate the effectiveness and applicability of the proposed method through some simulations.

Trimmed NURBS surface tessellation with sharp shape constraint (Sharp Shape를 유지하는 trimmed NURBS 곡면의 삼각화 방법)

  • Cho, Doo-Yeoun;Kim, In-Ill;Lee, Kyu-Yeul;Kim, Tae-Wan
    • Journal of Korea Game Society
    • /
    • v.2 no.1
    • /
    • pp.62-68
    • /
    • 2002
  • This paper presents a method for tessellating trimmed NURBS surface with preserving sharp shape Although several existing approaches need a large number of triangular meshes to represent sharp shape of surface, resulting triangular meshes may not reflect sharp edges properly. In this study, we flit detect the sharp shape of NURBS surface automatically using C1 continuous condition and then use constraint Delaunay triangulation method to present exact sharp shape with the minimum triangular meshes. And we also use approximated developed surface domain as triangulation domain of rimmed NURBS surface. In this way, the shape of triangular elements on the triangular domains is approximately preserved and can avoid distortion when mapped into three-dimensional space. finally, we show examples that demonstrate the effectiveness of the proposed scheme in terms of reducing the number of triangular meshes and preserving sharp shape of surface more exactly.

  • PDF