Two Motivating Examples: Sequential Orders on Quadtrees and Multidimensional Data Structures

Bäder, Michael

doi:10.1007/978-3-642-31046-1_1

Cited by 1 publication

(1 citation statement)

References 209 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But the maximal size processed by single texture (4096×4096) limit the MTLM algorithm scalability and tile data indexes should be improved [10]. Michael Bader organized tile data by designing space filling curve, as a result, improved the speed of terrain rendering [11]. HyeongYeop Kang realized GPU tessellation based on tile quad tree using Direct3D 11 [2].…”

Section: Introductionmentioning

confidence: 99%

Large Scale Terrain Real-Time Rendering on GPU Using Double Layers Tile Quad Tree and Cuboids Bounding Error Metric

Yang¹,

Wang²,

Gao³

et al. 2014

TOAUTOCJ

View full text Add to dashboard Cite

Improving terrain tile data selection efficiency, real-time loading of visible tile data and building GPU-based continuous Level of Details (LOD) are the key technologies for large scale terrain rendering on GPU. In this article, in order to reduce terrain tile data selection time, we build double layers tile quad tree for massive terrain data and organize tile data by designing Z-order space filling curve. According to the visible region coordinates obtained by GPU offscreen render to texture, we realize real-time loading of visible tile data from CPU to GPU. Map visible tile quad tree into twodimensional texture on GPU making full use of the characteristics of GPU multi-channel parallel processing. In order to execute tile error metric computation and LOD selection on GPU, we design GPU-based cuboid bounding unsaturated error metric, reduce CPU computational burden and enhance the terrain rendering performance. Experiments show that our algorithm can improve the utilization rate of GPU in the terrain rendering and achieve a good visual effect and a high frame rate.

show abstract

Section: Introductionmentioning

confidence: 99%