Optimal memory constrained isosurface extraction

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:1a9df2fde37b5f10df91a20e37272f4c

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. Vision, modeling and visualization. Stuttgart, Germany, 21. Nov 2001 - 23. Nov 2001. Berlin:AKA, pp. 351-358. ISBN 3-89838-028-9

@inproceedings{Saupe2001Optim-23138, title={Optimal memory constrained isosurface extraction}, year={2001}, isbn={3-89838-028-9}, address={Berlin}, publisher={AKA}, 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 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/rdf/resource/123456789/23138"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Toelke, Jürgen</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-17T08:15:26Z</dc:date> <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> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-17T08:15:26Z</dcterms:available> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23138"/> <dc:rights>deposit-license</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23138/1/Saupe_231383.pdf"/> <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> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23138/1/Saupe_231383.pdf"/> <dc:creator>Saupe, Dietmar</dc:creator> <dc:contributor>Saupe, Dietmar</dc:contributor> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dc:contributor>Toelke, Jürgen</dc:contributor> <dcterms:issued>2001</dcterms:issued> <dcterms:title>Optimal memory constrained isosurface extraction</dcterms:title> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Saupe_231383.pdf 83

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto