Název:	Real-time generation of continuous levels of detail for height fields
Autoři:	Röttger, Stefan Heidrich, Wolfgang Slusallek, Philipp Seidel, Hans-Peter
Citace zdrojového dokumentu:	Journal of WSCG. 1998, vol. 6, no. 1-3.
Datum vydání:	1998
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	článek article
URI:	http://hdl.handle.net/11025/15845 http://wscg.zcu.cz/wscg1998/wscg98.htm
ISSN:	1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online)
Klíčová slova:	GIS kontinuální úroveň detailů quadtree data
Klíčová slova v dalším jazyce:	GIS continuous levels of detail quadtree data
Abstrakt v dalším jazyce:	Height fields play an important role in the fast growing domain of Geographic Information Systems (GIS). For exploring different kinds of geographic-based data sets on screen it is necessary to display height fields at interactive frame rates. Because of the inherent geometric complexity, this goal is often unachievable even with new generations of powerful graphics computers, unless the original height field data is approximated in order to reduce the number of geometric primitives that need to be rendered without compromising visual quality. So far most algorithms have focused on global reduction or multi-resolution techniques, which reduce resolution on the basis of surface roughness. A recent new approach called Continuous Levels of Detail [LKR+96] introduced a hierarchical quadtree technique. In order to reduce the projected pixel error, the height field is dynamically triangulated in a bottom up fashion according to the distance to the point of view. Since resolution is allowed to change smoothly, the result is a much better image quality. However, this algorithm still has a major disadvantage. With the viewpoint moving, the triangulation is continuously changing, resulting in a phenomenon called vertex popping. As the observer approaches an area with detail information, this detail will suddenly appear at a certain distance. To eliminate these artifacts we introduce a new, rapid geomorphing algorithm, which operates top down on a quadtree data structure.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	Volume 6, number 1-3 (1998)

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.