• Title/Summary/Keyword: Triangulation

Search Result 672, Processing Time 0.027 seconds

A Constrained Triangulation Technique for Visualization on Mobile Devices (모바일 장치에서의 가시화를 위한 경계기반 삼각화)

  • Yang, Sang-Wook;Choi, Young
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.6
    • /
    • pp.413-421
    • /
    • 2007
  • 3D rendering is becoming a common feature of mobile application programs with the rapid advance of mobile devices. Since the existing rendering engines do not provide triangulation functions, mobile 3D programs have focused on an efficient handling with pre-tessellated geometry. In addition, triangulation is comparatively expensive in computation, so it seems that the triangulation cannot be easily implemented on mobile devices with limited resources. Triangulation of 3D geometry is the essential process of visualization of 3D model data and many different triangulation methods have been reported. We developed a light and fast visualization process that involves constrained triangulation based on Voronoi diagram and applied it to a mobile computer application. In this paper, we applied kd-tree to the original incremental construction algorithm and produced new O(nlogn) incremental construction algorithm. And we show a simple and efficient constrained triangulation method based on Voronoi diagram. This paper also describes an implementation of mobile STEP data viewer as an application of our proposed algorithms.

Development of Delaunay Triangulation Algorithm Using Subdivision (분할 Delaunay 삼각화 알고리즘 개발)

  • 박시형;이성수
    • Korean Journal of Computational Design and Engineering
    • /
    • v.7 no.4
    • /
    • pp.248-253
    • /
    • 2002
  • Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as reverse engineering, shape reconstruction, solid modeling and volume rendering. For Example, In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are nonuniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

Modified Delaunay Triangulation Based on Data Structure of Geometric Modeller (형상 모델러의 자료구조에 의한 수정 Delaunay 삼각화)

  • Chae E.-M.;Sah J.-Y.
    • Journal of computational fluids engineering
    • /
    • v.2 no.2
    • /
    • pp.97-103
    • /
    • 1997
  • A modified Delaunay triangulation technique is tested for complicated computational domain. While a simple geometry. both in topology and geometry, has been well discretized into triangular elements, a complex geometry having difficulty in triangulation had to be divided into small sub-domains of simpler shape. The present study presents a modified Delaunay triangulation method based on the data structure of geometric modeller. This approach greatly enhances the reliability of triangulation, especially in complicated computational domain. We have shown that efficiency of Delaunay triangulation can be much improved by using both the GUI (Graphic User Interface) and OOP (Object-Oriented Programming).

  • PDF

EXISTENCE OF SPANNING 4-SUBGRAPHS OF AN INFINITE STRONG TRIANGULATION

  • Jung, Hwan-Ok
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.851-860
    • /
    • 2008
  • A countable locally finite triangulation is a strong triangulation if a representation of the graph contains no vertex- or edge-accumulation points. In this paper we exhibit the structure of an infinite strong triangulation and prove the existence of connected spanning subgraph with maximum degree 4 in such a graph

  • PDF

A study on aerial triangulation from multi-sensor imagery

  • Lee, Young-ran;Habib, Ayman;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.400-406
    • /
    • 2002
  • Recently, the enormous increase in the volume of remotely sensed data is being acquired by an ever-growing number of earth observation satellites. The combining of diversely sourced imagery together is an important requirement in many applications such as data fusion, city modeling and object recognition. Aerial triangulation is a procedure to reconstruct object space from imagery. However, since the different kinds of imagery have their own sensor model, characteristics, and resolution, the previous approach in aerial triangulation (or georeferencing) is performed on a sensor model separately. This study evaluated the advantages of aerial triangulation of large number of images from multi-sensors simultaneously. The incorporated multi-sensors are frame, push broom, and whisky broom cameras. The limits and problems of push-broom or whisky broom sensor models can be compensated by combined triangulation with frame imagery and vise versa. The reconstructed object space from multi-sensor triangulation is more accurate than that from a single model. Experiments conducted in this study show the more accurately reconstructed object space from multi-sensor triangulation.

  • PDF

A Study on Aerial Triangulation from Multi-Sensor Imagery

  • Lee, Young-Ran;Habib, Ayman;Kim, Kyung-Ok
    • Korean Journal of Remote Sensing
    • /
    • v.19 no.3
    • /
    • pp.255-261
    • /
    • 2003
  • Recently, the enormous increase in the volume of remotely sensed data is being acquired by an ever-growing number of earth observation satellites. The combining of diversely sourced imagery together is an important requirement in many applications such as data fusion, city modeling and object recognition. Aerial triangulation is a procedure to reconstruct object space from imagery. However, since the different kinds of imagery have their own sensor model, characteristics, and resolution, the previous approach in aerial triangulation (or georeferencing) is purformed on a sensor model separately. This study evaluated the advantages of aerial triangulation of large number of images from multi-sensors simultaneously. The incorporated multi-sensors are frame, push broom, and whisky broom cameras. The limits and problems of push-broom or whisky broom sensor models can be compensated by combined triangulation with other sensors The reconstructed object space from multi-sensor triangulation is more accurate than that from a single model. Experiments conducted in this study show the more accurately reconstructed object space from multi-sensor triangulation.

3D Mesh Creation using 2D Delaunay Triangulation of 3D Point Clouds (2차원 딜로니 삼각화를 이용한 3차원 메시 생성)

  • Choi, Ji-Hoon;Yoon, Jong-Hyun;Park, Jong-Seung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.13 no.4
    • /
    • pp.21-27
    • /
    • 2007
  • The 3D Delaunay triangulation is the most widely used method for the mesh creation via the triangulation of a 3D point cloud. However, the method involves a heavy computational cost and, hence, in many interactive applications, it is not appropriate for surface triangulation. In this paper, we propose an efficient triangulation method to create a surface mesh from a 3D point cloud. We divide a set of object points into multiple subsets and apply the 2D Delaunay triangulation to each subset. A given 3D point cloud is cut into slices with respect to the OBB(Oriented Bounding Box) of the point set. The 2D Delaunay triangulation is applied to each subset producing a partial triangulation. The sum of the partial triangulations constitutes the global mesh. As a postprocessing process, we eliminate false edges introduced in the split steps of the triangulation and improve the results. The proposed method can be effectively applied to various image-based modeling applications.

  • PDF

On Quality Triangulation in Three-Dimensional Space (삼차원 공간상에서의 질적인 삼각화에 관한 연구)

  • Park, Joon-Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.1
    • /
    • pp.215-222
    • /
    • 1997
  • This paper deals with the problem of generating a uniform tetrahedral mesh which fills a 3-D space with the tetrahedra which are close to the equilateral tetrahedra as possible. This problem is particularly interesting in finite element modeling where a fat triangulation minimizes the error of an analysis. Fat triangulation is defined as a scheme for generating an equilateral triangulation as possible in a given dimension. In finite element modeling, there are many algorithms for generating a mesh in 2-D and 3-D. One of the difficulties in generating a mesh in 3-D is that a 3-D object can not be filled with uniform equilateral tetrahedra only regardless of the shape of the boundary. Fat triangulation in 3-D has been proved to be the one which fills a 3-D space with the tetrahedra which are close to the equilateral as possible. Topological and geometrical properties of the fat triangulation and its application to meshing algorithm are investigated.

  • PDF

Development of Delaunay triangulation algorithm using quad subdivision (Quad-Subdivision을 이용한 Delaunay 삼각화 알고리즘 개발)

  • 박시형;이성수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2000.10a
    • /
    • pp.151-156
    • /
    • 2000
  • Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as shape reconstruction, solid modeling and volume rendering. In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are non-uniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

  • PDF

A Polygen Morphing Algorithm using Triangulation (삼각분할을 이용한 다각형의 형태변환 알고리즘)

  • 송은하;이주희;이상호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10b
    • /
    • pp.673-675
    • /
    • 1998
  • 본 논문에서는 다각형과 같은 2차원 기하학적인 물체에 대한 형태변환을 위하여 다격형의 삼각분할(triangulation)과 트리의 연산을 이용하는 새로운 알고리즘을 제안하였다. 원시 다각형(source polygon)과 목적 다각형(target polygon)이 주어졌을 때, 대상이 되는 두 다각형을 각각 삼각분할(triangulation)하고 그의 듀얼 트리를 구한 후 이 트리를 이용하여 원시 다각형에서 목적 다각형으로 형태를 변환한다. 두 개의 다각형이 자연스럽게 형태가 변환되도록 하기 위해서 유사 삼각분할(similar triangulation)의 개념을 이용하였다.