@ARTICLE{Isenburg-2003-OutofCorea,
	AUTHOR = {Isenburg, Martin and Gumhold, Stefan},
	AFFILIATIONS = {CGV,GRIS},
	AREAS = {areagp},
	TITLE = {Out-of-core Compression for Gigantic Polygon Meshes},
	JOURNAL = {ACM Trans. Graph.},
	VOLUME = {22},
	NUMBER = {3},
	MONTH = {July},
	YEAR = {2003},
	PAGES = {935--942},
	PUBLISHER = {ACM},
	ADDRESS = {New York, NY, USA},
	ISSN = {0730-0301},
	URL = {http://doi.acm.org/10.1145/882262.882366},
	DOI = {10.1145/882262.882366},
	KEYWORDS = {external memory data structures, mesh compression, out-of-core algorithms, processing sequences, streaming meshes},
	ABSTRACT = { Polygonal models acquired with emerging 3D scanning technology or from large scale 
		CAD applications easily reach sizes of several gigabytes and do not fit in the address space 
		of common 32-bit desktop PCs. In this paper we propose an out-of-core mesh compression technique 
		that converts such gigantic meshes into a streamable, highly compressed representation. During 
		decompression only a small portion of the mesh needs to be kept in memory at any time. As full 
		connectivity information is available along the decompression boundaries, this provides seamless 
		mesh access for incremental in-core processing on gigantic meshes. Decompression speeds are 
		CPU-limited and exceed one million vertices and two million triangles per second on a 1.8 GHz 
		Athlon processor.A novel external memory data structure provides our compression engine with 
		transparent access to arbitrary large meshes. This out-of-core mesh was designed to accommodate 
		the access pattern of our region-growing based compressor, which - in return - performs mesh 
		queries as seldom and as local as possible by remembering previous queries as long as needed and 
		by adapting its traversal slightly. The achieved compression rates are state-of-the-art.}
}