Interactive out-of-core isosurface extraction

Yi-Jen Chiang, Claudio Silva, William J. Schroeder

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells in disk, from the indexing structure, which is also in disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary-blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than the existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single-cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Visualization Conference
Editors Anon
PublisherIEEE Comp Soc
Pages167-174
Number of pages8
StatePublished - 1998
EventProceedings of the 1998 IEEE Visualization Conference - Research Triangle Park, NC, USA
Duration: Oct 18 1998Oct 23 1998

Other

OtherProceedings of the 1998 IEEE Visualization Conference
CityResearch Triangle Park, NC, USA
Period10/18/9810/23/98

Fingerprint

Data structures
Computer workstations
Visualization
Cells
Data storage equipment
Costs

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Chiang, Y-J., Silva, C., & Schroeder, W. J. (1998). Interactive out-of-core isosurface extraction. In Anon (Ed.), Proceedings of the IEEE Visualization Conference (pp. 167-174). IEEE Comp Soc.

Interactive out-of-core isosurface extraction. / Chiang, Yi-Jen; Silva, Claudio; Schroeder, William J.

Proceedings of the IEEE Visualization Conference. ed. / Anon. IEEE Comp Soc, 1998. p. 167-174.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chiang, Y-J, Silva, C & Schroeder, WJ 1998, Interactive out-of-core isosurface extraction. in Anon (ed.), Proceedings of the IEEE Visualization Conference. IEEE Comp Soc, pp. 167-174, Proceedings of the 1998 IEEE Visualization Conference, Research Triangle Park, NC, USA, 10/18/98.
Chiang Y-J, Silva C, Schroeder WJ. Interactive out-of-core isosurface extraction. In Anon, editor, Proceedings of the IEEE Visualization Conference. IEEE Comp Soc. 1998. p. 167-174
Chiang, Yi-Jen ; Silva, Claudio ; Schroeder, William J. / Interactive out-of-core isosurface extraction. Proceedings of the IEEE Visualization Conference. editor / Anon. IEEE Comp Soc, 1998. pp. 167-174
@inproceedings{f3e8980239024e2190d15e8eb948dc74,
title = "Interactive out-of-core isosurface extraction",
abstract = "In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells in disk, from the indexing structure, which is also in disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary-blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than the existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single-cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.",
author = "Yi-Jen Chiang and Claudio Silva and Schroeder, {William J.}",
year = "1998",
language = "English (US)",
pages = "167--174",
editor = "Anon",
booktitle = "Proceedings of the IEEE Visualization Conference",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - Interactive out-of-core isosurface extraction

AU - Chiang, Yi-Jen

AU - Silva, Claudio

AU - Schroeder, William J.

PY - 1998

Y1 - 1998

N2 - In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells in disk, from the indexing structure, which is also in disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary-blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than the existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single-cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.

AB - In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells in disk, from the indexing structure, which is also in disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary-blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than the existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single-cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.

UR - http://www.scopus.com/inward/record.url?scp=0032278354&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032278354&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0032278354

SP - 167

EP - 174

BT - Proceedings of the IEEE Visualization Conference

A2 - Anon, null

PB - IEEE Comp Soc

ER -