By Topic

A Two-Level Algorithm for Large-Scale Terrain Using Nested Regular Grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
He Bing ; Dept. of Comput. Sci. & Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Sui Lei

We propose a two-level algorithm for large-scale terrain using nested regular grids. To avoid large computing cost by numerous low-resolution blocks, we merge these low-resolution blocks into one level, use nested regular grids to process the other level contains high-resolution blocks, and merge the two levels in GPU, while ensuring the rendering effects, significantly improve the frame rate. Additional, in accordance with the characteristics of the nested regular grid, this paper use a simple and effective strategy for data loading, and rationally organize the out-of-core data, which significantly reduce the real-time loading of the out-of-core data.

Published in:

Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on

Date of Conference:

18-20 Jan. 2009