Publikation: Optimal memory constrained isosurface extraction
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivision of the volume or they organize the scalar values attached to the cells of the volume, i.e., intervals, in some suitable data structures. Octrees, kd-trees, and interval trees are commonly applied. However, these data structures demand storage space that can be many times as large as the original volume data. In practice storage space is constrained and, therefore, new algorithms may be necessary that adapt the size of the data structures to the given limits. We present a hybrid algorithm which combines binary space partition (BSP) trees with fast search methods at some leaf nodes of the BSP-tree and memory-free linear search at the remaining leaf nodes. The method optimally trades off space for extraction speed.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
SAUPE, Dietmar, Jürgen TOELKE, 2001. Optimal memory constrained isosurface extraction. Vision, modeling and visualization. Stuttgart, Germany, 21. Nov. 2001 - 23. Nov. 2001. In: ERTL, T., ed. and others. Vision, modeling and visualization 2001 : proceedings ; November 21 - 23, 2001, Stuttgart, Germany. Berlin: AKA, 2001, pp. 351-358. ISBN 3-89838-028-9BibTex
@inproceedings{Saupe2001Optim-23138, year={2001}, title={Optimal memory constrained isosurface extraction}, isbn={3-89838-028-9}, publisher={AKA}, address={Berlin}, booktitle={Vision, modeling and visualization 2001 : proceedings ; November 21 - 23, 2001, Stuttgart, Germany}, pages={351--358}, editor={Ertl, T.}, author={Saupe, Dietmar and Toelke, Jürgen} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/23138"> <dc:contributor>Saupe, Dietmar</dc:contributor> <dcterms:title>Optimal memory constrained isosurface extraction</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23138/1/Saupe_231383.pdf"/> <dc:creator>Toelke, Jürgen</dc:creator> <dcterms:issued>2001</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-17T08:15:26Z</dcterms:available> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:abstract xml:lang="eng">Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivision of the volume or they organize the scalar values attached to the cells of the volume, i.e., intervals, in some suitable data structures. Octrees, kd-trees, and interval trees are commonly applied. However, these data structures demand storage space that can be many times as large as the original volume data. In practice storage space is constrained and, therefore, new algorithms may be necessary that adapt the size of the data structures to the given limits. We present a hybrid algorithm which combines binary space partition (BSP) trees with fast search methods at some leaf nodes of the BSP-tree and memory-free linear search at the remaining leaf nodes. The method optimally trades off space for extraction speed.</dcterms:abstract> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <dcterms:bibliographicCitation>Vision, modeling and visualization 2001 : proceedings; November 21-23, 2001, Stuttgart, Germany / T. Ertl ... (eds.). - Berlin : AKA, 2001. - S. 351-358. - ISBN 3-89838-028-9</dcterms:bibliographicCitation> <dc:contributor>Toelke, Jürgen</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23138/1/Saupe_231383.pdf"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Saupe, Dietmar</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23138"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-17T08:15:26Z</dc:date> </rdf:Description> </rdf:RDF>