de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45604

Tevs,  Art
Computer Graphics, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44670

Ihrke,  Ivo
Graphics - Optics - Vision, MPI for Informatics, Max Planck Society;
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45449

Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Tevs, A., Ihrke, I., & Seidel, H.-P. (2008). Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering. In S. Spencer (Ed.), Proceedings I3D 2008: Symposium on Interactive 3D Graphics and Games (pp. 183-190). New York, NY: ACM.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1C2E-9
Abstract
This paper presents a GPU-based, fast, and accurate dynamic height field rendering technique that scales well to large scale height fields. Current real-time rendering algorithms for dynamic height fields employ approximate ray-height field intersection methods, whereas accurate algorithms require pre-computation in the order of seconds to minutes and are thus not suitable for dynamic height field rendering. We alleviate this problem by using maximum mipmaps, a hierarchical data structure supporting accurate and efficient rendering while simultaneously lowering the pre-computation costs to negligible levels. Furthermore, maximum mipmaps allow for view-dependent level-of-detail rendering. In combination with hierarchical ray-stepping this results in an efficient intersection algorithm for large scale height fields.