디테일을 유지하는 대규모 지형의 GPU 기반 가시화 및 편집
A GPU based Technique for Massive Terrain Data Visualization and Editing Preserving Details
1
조회
0
다운로드
6
인용
0
참고문헌
키워드
초록
본 논문은 대규모 지형을 GPU를 이용한 실시간 가시화 및 고속 편집 방법에 대해 제안한다. 대규모 지형은 64× 64 평면 메시를 GPU 셰이더(Shader)의 테셀레이션 과정에서 LOD(Levels of Detail)를 적용하여 테셀레이션 수행 후 변위 매핑을 통해 지형의 높낮이를 결정하여 생성하였다. 이후 노멀맵으로부터 지형을 구성하는 정점들의 법선 정보를 각 정점별로 계산한 후 조명 효과를 적용하여 가시화하였다. 또한 데이터의 병렬처리에 최적화된 GPGPU(General-Purpose computing on GPU)를 이용하여 지형의 전체적인 노이즈 효과 및 가우시안 블러, 평균 필터를 적용한 부드러운 지형 편집에 대해 수행하였다. 마지막으로 본 논문에서는 대규모 지형의 가시화 성능과 지형 편집 시 CPU와 GPU를 이용해 수행한 성능을 측정하였으며 GPU에서 수행하였을 시 고속의 성능을 보였다.
Abstract
In this paper, we propose a GPU based technique for massive terrain data visualization and editing while preserving details. The 64× 64 plane mesh tessellate with LOD(Levels of Detail) in GPU Tessellation stages for creation of massive terrain. After tessellation, the terrain height is calculated by displacement mapping. Normal vector of each vertex is calculated from normal map for natural visualization by applying light effect. And we perform noise, Gaussian blur and mean editing at the whole of massive terrain editing using GPGPU (General-Purpose computing on GPU) that is optimized for data parallel processing. The evaluation of performance measure of massive terrain visualization and editing between CPU and GPU shows that the GPU outperforms as compared to CPU.
참고문헌 (25)
- B. Jonathan, "Terrain Rendering Research for Games" (2000), ACM SIGGRAPH Couses
- J. Shopef, "March of the Froblins : Simulation and RenderingMassive Crowds of Intelligent and DetailedCreature on GPU", ACM SIGGRAPH courses, pp.52~101 (2008)
- R. L. Cook, "Shade Tree", ACM SIGGRAPH Computer Graphics, 18(3), pp.223~231 (1984)
- D. B. Kirk, "Programming Massively Parallel Processors", pp.21~37 (2010), Morgan Kaufmann
- R. Finkel, "Quad Trees: A Data Structure for Retrieval on Composite Key", ACTA Informatica, 4(1), pp.1~9 (1974)
- T. Ulrich, "Loose Octrees", Game Programming Gems, Charles River Media, 444~453 (2000)
- H. Fuchs, "On Visible Surface Generation by A Priori Tree Structures", ACM Computer Graphics, 14(3), pp.124~133 (1980)
- J. H. Clark, "Hierarchical Geometric Models for Visible Surface Algorithms", Communication of the ACM, 19(10), pp.547~554 (1976)
- J. F. Blinn, "Simulation of Wrinkeled Surface", ACM SIGGRAPH Computer Graphics, 12(3) (1978)
- T. Kaneko, "Detailed Shape Representation with Parallax Mapping", Proceedings of the ICAT, pp.205~208 (2001)
- F. Policarpo, "Real-Time Relief Mapping on ArbitraryPolygon Surface", Proceedings of the 2005Symposium on Interactive 3D Graphics andGames, pp.155~162 (2005)
- T. Whitted, "An Improved Illumination Model for Shaded Display", ACM SIGGRAPH Computer Graphics, 13(2) (1979)
- R. Wang, "An Efficient GPU-based Approach for InteractiveIllumination", ACM Transaction on Graphics, 28(3) (2009)
- In Lee, "Real-time Rendering for Massive Terrain Data using GPUs", International Conference on Cloud Computing and Society networking (2012)
- Iain Cantlay, "DirectX 11 Terrain Tessellation", NVIDIA, ~ (2011)
- "OpenGL 4 Tessellation" (2012)[URL]
- K. Perlin, "Improving Noise", ACM Transaction on Graphics, 21(3) (2002)
- E. Reinhard, "High Dynamic Range Imaging", pp.233~235 (2006), Morgan Kaufmann
- M. Nixon, "Feature Extraction & Image Processing, 2nd Edition", pp.84~94 (2008), Academic Press
- "Parallel Programming and Computing Platform,| CUDA | NVIDIA" (2012)[URL]
- "OpenCL -The open standard for parallel programming of heterogeneous systems" (2012)[URL]
- "Compute Shader Overview" (2012)[URL]
- "NVIDIA, OptiX" (2012)[URL]
- "Perlin Noise" (2012)[URL]
- "NVIDIA, CUDA C/C++ SDK Code Samples" (2012)[URL]