OUT OF CORE CONSTRUCTION OF PATCH TREES

Hermann Birkholz

2007

Abstract

Current Level of Detail (LoD) approaches for triangle meshes use variably triangulated mesh patches in order to approximate the original mesh surface. The approximation is synthesized from some of these patches, which have to cover the whole surface and must not intersect each other. The patches are chosen corresponding to the necessary view dependent triangulation. This paper addresses the creation of the required hierarchical data structures, in order to enable Level of Detail synthesis for very large triangle meshes. Because of the limited amount of internal memory, most of the mesh data reside in external memory during the process. Due to the high access latency of external memory, commonly used algorithms for small meshes are hardly applicable for so called “Out of Core” meshes. Other methods have to be found that overcome the problems with the external memory.

Paper Citation

in Harvard Style

Birkholz H. (2007). OUT OF CORE CONSTRUCTION OF PATCH TREES . In Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, ISBN 978-972-8865-71-9, pages 153-158. DOI: 10.5220/0002081801530158

in Bibtex Style

@conference{grapp07,
author={Hermann Birkholz},
title={OUT OF CORE CONSTRUCTION OF PATCH TREES},
booktitle={Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,},
year={2007},
pages={153-158},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002081801530158},
isbn={978-972-8865-71-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,
TI - OUT OF CORE CONSTRUCTION OF PATCH TREES
SN - 978-972-8865-71-9
AU - Birkholz H.
PY - 2007
SP - 153
EP - 158
DO - 10.5220/0002081801530158