1 / 9

“Perspective Based Level of Detail Management of Topographic Data”

“Perspective Based Level of Detail Management of Topographic Data”. By: Morten Granlund Supervisor: Gunnar Misund. http://www.ia-stud.hiof.no/~mortengr. Level of Detail. “Easing the burden of the 3D renderer…”. The basics of Level of Detail. GOAL: Render 3D graphics fast!

galena-hodges
Download Presentation

“Perspective Based Level of Detail Management of Topographic Data”

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. “Perspective BasedLevel of Detail Managementof Topographic Data” By: Morten Granlund Supervisor: Gunnar Misund http://www.ia-stud.hiof.no/~mortengr

  2. Level of Detail “Easing the burden of the 3D renderer…”

  3. The basics of Level of Detail • GOAL: Render 3D graphics fast! • SOLUTION: Several levels of detail.

  4. One square has a fixed data-size A model is more accurate if: The model has more squares. Each square covers a smaller area. More on LoD

  5. Tree Structure Level 0 Square covers >200 km zoom Level 1 Square covers 100-200 km  zoom Level 2 Square covers 50-99 km 

  6. Rez… • …is an Open Source framework for translating terrain data. • …creates Level of Detail hierarchies. • …creates two parallel hierarchies: • Tiles • Trees model tiles trees

  7. World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl Tiles • Tree containing VRML data. • Each node is called a tile. • Each tile contains a matrix with heights (elevation grid). tiles 0 1 2 3 4

  8. tiles trees 0 1 2 3 4 0 1 2 3 4 World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl Trees • The Trees hierarchy contains the structure. • The trees structure consists of a file hierarchy parallel to the tiles. • A trees node is a “wrapping” around each tile.

  9. tiles trees 0 1 2 3 4 0 1 2 3 4 World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl World.wrl A “Trees”-node has: • Reference to Parent node • Reference to Children nodes (x4) • Reference to the terrain data (tile node)

More Related