GPU-parallel interpolation using the edge-direction based normal vector method for terrain triangular mesh
- Authors
- Wu, Jiaji; Deng, Long; Jeon, Gwanggil; Jeong, Je chang
- Issue Date
- Apr-2018
- Publisher
- SPRINGER HEIDELBERG
- Keywords
- Terrain model; Triangular mesh; Normal vector; Normal interpolation; Edge-direction interpolation; CUDA; GPU
- Citation
- JOURNAL OF REAL-TIME IMAGE PROCESSING, v.14, no.4, pp.813 - 822
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF REAL-TIME IMAGE PROCESSING
- Volume
- 14
- Number
- 4
- Start Page
- 813
- End Page
- 822
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3915
- DOI
- 10.1007/s11554-016-0575-1
- ISSN
- 1861-8200
- Abstract
- In the geographic information field, triangular mesh modes are often used to describe terrain, where the normal vector to the surface at the node of a triangular mesh plays an important role in reconstruction and display. However, the normal vectors on the nodes of triangular meshes cannot be given directly, but instead must be computed using known data. Currently, the most common method of computing the normal vector at the nodes on a triangular mesh is to sum the normal vectors of the adjacent triangular facets using various weighting factors. For complex terrain surfaces, such a method is not very effective, and in some cases is not as good as classical weighted average algorithms. By studying interpolation based on edge-direction, combined with a terrain triangular mesh, we propose using a GPU-Parallel normal vector interpolation meth od based on the edge-direction for a terrain triangular mesh. Since terrain data is usually large, traditional serial algorithms are difficult to use while still meeting real-time requirements. In this paper, we use CUDA optimization strategies to make full use of the GPU (NVIDIA TESLA K80) for effectively solving this problem. The experimental results show that compared to traditional weighted average algorithms, the accuracy of the normal vector to the surface at the node increases significantly, and compared to serial algorithms only on CPU, speeds are increased by 646.4 times with the I/O transfer time being taken into account, meeting the real-time requirements.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3915)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.