• Title/Summary/Keyword: Delaunay 삼각기법

Search Result 36, Processing Time 0.023 seconds

Detecting Uncertain Boundary Algorithm using Constrained Delaunay Triangulation (제한된 델로네 삼각분할을 이용한 공간 불확실한 영역 탐색 기법)

  • Cho, Sunghwan
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.2
    • /
    • pp.87-93
    • /
    • 2014
  • Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.

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.

Morphing and Warping using Delaunay Triangulation in Android Platform (안드로이드 플랫폼에서 들로네 삼각망을 이용한 모핑 및 와핑 기법)

  • Hwang, Ki-Tae
    • Journal of Korea Game Society
    • /
    • v.10 no.6
    • /
    • pp.137-146
    • /
    • 2010
  • According to rapid advent of the smartphone, software technologies which have been used on PCs are being introduced into the smartphone. This paper introduces an implementation of an application software under the Android platform using morphing and warping technology. It composes two face images with morphing technology and also transforms an original face image using warping technology for fun. For this, the image is triangulated by Delaunay Triangulation based on control points which are created by simple LCD touches on the mobile device. The implementation case of this paper will be a good reference for the development of applications like games using morphing and warping technologies over Android platforms.

The Petrov-Galerkin Natural Element Method : I. Concepts (페트로프-갤러킨 자연요소법 : I. 개념)

  • Cho, Jin-Rae;Lee , Hong-Woo
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.18 no.2
    • /
    • pp.103-111
    • /
    • 2005
  • In this paper, a new meshfree technique which improves the numerical integration accuracy is introduced. This new method called thc Petrov-Galerkin natural clement method(PG-NEM) by authors is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used lot conventional natural clement method called the Bubnov-Galerkin natural element method(BG-NEM). But, unlike the BG-NEM, the test basis function is differently chosen, based on the concept of Petrov-Galerkin, such that its support coincides exactly with a regular integration region in background mesh. Therefore, it is expected that the proposed technique ensures the remarkably improved numerical integration accuracy in comparison with the BG-NEM.

POCS Based Interpolation Method for Irregularly Sampled Image (불규칙한 샘플 영상에 대한 POCS 기반 보간법)

  • Lee, Jong-Hwa;Lee, Chul-Hee
    • Journal of Broadcast Engineering
    • /
    • v.16 no.4
    • /
    • pp.669-679
    • /
    • 2011
  • In this paper, we propose a POCS based irregularly sampled image interpolation method exploiting non-local block-based wavelet shrinkage denoising algorithm. The method provides convex sets to improve the performance. The Delaunay triangulation interpolation is first applied to interpolate the missing pixels of the irregularly sampled image into the regular grids. Then, the non-local block-based wavelet shrinkage denoising algorithm is applied, and the originally observed pixels are enforced. After iteration is performed, the denoising algorithm for non-edge areas is applied to acquire the final result. The experimental results show that the proposed method outperforms the conventional methods.

Development of Mesh Generator for 2D Hydraulic Analysis(II) (2차원 수리해석을 위한 범용 Mesh Generation의 개발(II))

  • Kim, Eu-Gene;Jang, Hyung-Sang;Kim, Hong-Sik;Seo, Il-Won
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2006.05a
    • /
    • pp.396-401
    • /
    • 2006
  • 하천의 2차원 흐름, 유사이동 그리고, 오염 확산의 정도를 알아보기 위해 유한 요소법을 이용한 해석 방법이 널리 사용되고 있다. 유한 요소법을 이용할 때 유한 요소망 생성이 필수적이며, 해석 결과에 크게 영향을 주는 변수로 작용하게 된다. 본 연구에서는 복잡한 경계를 가진 하천의 유한 요소망 생성을 위해 대표적인 비구조적 요소망 생성 기법인 Delaunay 삼각화 기법과 흐름의 특성을 잘 나타낼 수 있도록 Transfinite 보간법을 이용한 구조적 요소망 생성 기법을 구현하였다. 그리고, 본 연구에 의해 생성된 유한 요소망의 형질 평가를 통해서 해석 결과에 대한 신뢰성을 높였으며, 요소망 생성 GUI 프로그램을 통하여 요소망에 대한 1차식의 요소와 2차식의 요소간의 변환, 되돌리기, 다시 실행 등의 기능을 지원하여 사용의 편리성을 추가하였다.

  • PDF

A Study on Error Verification of STL Format for Rapid Prototyping System (급속조형 시스템을 위한 STL 포맷의 오류 검증에 관한 연구)

  • Park, H.T.;Lee, S.H.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.10
    • /
    • pp.46-55
    • /
    • 1996
  • As industrial standard data, the STL format which approximates three dimensional CAD model to triangular facets, is used for RP(Rapid Prototyping) system in recent days. Because most RP system take the only form of two dimensional line segments as an input stream inspite of its imperfectness while converting into STL format, a CAD model is converted into a standard industrial format which is composed of many triangular facets. The error verifying process is composed of four main steps, and these are 1) Remove facets with two or more vertices equal to each other. 2) Fix overlapping error such as more than three facets adjacent to anedge. 3) Fill holes in the mesh by using Delaunay triangulation method. 4) Correct the wrong direction and normal vectors. This paper is concerned with serching the mentioned errors in advance and modifying them.

  • PDF

Efficient Mesh Modeling using Silhouette Contour Constraint from Depth Map (경계라인 제약조건을 이용한 깊이 맵 기반 메쉬 모델링)

  • Park Jeungchul;Kim Seung-man;Lee Kwan H.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.682-684
    • /
    • 2005
  • 본 논문에서는 동적인 실제 객체로부터 얻어진 깊이 맵으로부터 3차원 메쉬 모델을 생성할 때, 영상의 경계정보를 기반으로 효율적인 비정규 메쉬를 생성하는 기법을 제안한다. 우선 깊이 맵으로부터 소수의 특징점과 경계영역에서의 실루엣 점을 추출한다. Delaunay 삼각화 기법을 적용할 때 경계 피부에 발생하는 불필요한 삼각형들을 효율적으로 제거하기 위해 실루엣점으로 구성된 경계 라인을 제약조건으로 사용한다. 즉 깊이 맵으로부터 경계 영역 정보를 추출하고 이를 기반으로 관심 객체의 비정규 삼각 메쉬에 존재하는 불필요한 외부 삼각형을 제거한다. 최종적으로 생성된 3차원 메쉬에 포함된 형상 노이즈를 제거하기 위해 메쉬 스무딩 기법을 적용하고, 깊이 맵과 동시에 획득된 컬러 영상을 텍스쳐링하여 3차원 메쉬를 생성한다.

  • PDF

Rubber Sheeting Algorithm for Resolving Digital Map Mismatches (수치지도 불일치 해결을 위한 자동 보정 알고리즘)

  • Jo, Mi-Gyeong;Jo, Hwan-Gyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.1
    • /
    • pp.191-201
    • /
    • 1998
  • 지리 정보 시스템에서 수치지도 보정(rubber sheeting)이란 물리적으로 동일 지역을 나타내고 있지만 일치하지 않는 두 지도사이의 불일치한 부분이 일치되도록 보정해 주는 것을 말한다. 불일치 종류는 수치지도를 생성하는 방법과 과정 등에서 발생할 수 있으며 또한 시간의 흐름에 따라 변화는 지리 정보의 특성으로 인해 발생하기도 한다. 본 논문에서는 지리 정보 시스템의 성능을 저하시키는 중요한 원인인 불일치 문제를 해결하기 위한 새로운 수치지도 보정 알고리즘을 제시한다. 제시한 방법은 다각형 커널의 무게 중심을 이용하여 다각형을 삼각분할한 후 삼각형 매핑을 적용하는 것이다. 다각형 외부에 위치한 시설물에 대해서도 동일한 방법을 적용하기 위해 제한된 딜로니(Delaunay)삼각분할을 이용하여 외부 영역을 다각형의 집합으로 만들어 주는 방법을 제시한다. 또한 본 논문에서는 수치지도 보정 결과를 평가하기 위한 측정 함수를 제시하였다. 측정 함수는 지리 정보의 특성을 구분짓는 세 가지 중요한 요소인 방향적(directional), 위상적(topological), 측량적(metrical)특성을 이용한다. 그리고 수치지도와 다양한 테스트 데이터를 이용하여 제시한 기법의 성능을 실험하고 그 결과를 측정 함수로 분석하여 제시한 기법이 불일치 해결에 좋은 결과를 보여 줌을 밝힌다.

  • PDF

An Energy-efficient Edge Detection Method for Continuous Object Tracking in Wireless Sensor Networks (무선 센서 네트워크에서의 연속적인 물체의 추적을 위한 에너지 효율적인 경계 선정 기법)

  • Jang, Sang-Wook;Hahn, Joo-Sun;Ha, Rhan
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.6
    • /
    • pp.514-527
    • /
    • 2009
  • Wireless sensor networks (WSNs) can be used in various applications for military or environmental purpose. Recently, there are lots of on-going researches for detecting and tracking the spread of continuous objects or phenomena such as poisonous gas, wildfires, earthquakes, and so on. Some previous work has proposed techniques to detect edge nodes of such a continuous object based on the information of all the 1-hop neighbor nodes. In those techniques, however, a number of nodes are redundantly selected as edge nodes, and thus, the boundary of the continuous object cannot be presented accurately. In this paper, we propose a new edge detection method in which edge nodes of the continuous object are detected based on the information of the neighbor nodes obtained via the Localized Delaunay Triangulation so that a minimum number of nodes are selected as edge nodes. We also define the sensor behavior rule for tracking continuous objects energy-efficiently. Our simulation results show that the proposed edge detection method provides enhanced performance compared with previous 1-hop neighbor node based methods. On the average, the accuracy is improved by 29.95% while the number of edge nodes, the amount of communication messages and energy consumption are reduced by 54.43%, 79.36% and 72.34%, respectively. Moreover, the number of edge nodes decreases by 48.38% on the average in our field test with MICAz motes.