The input/output complexity of sorting and related problems
Communications of the ACM
VIS '97 Proceedings of the 8th conference on Visualization '97
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Optimal External Memory Interval Management
SIAM Journal on Computing
Topological manipulation of isosurfaces
Topological manipulation of isosurfaces
Simplifying Flexible Isosurfaces Using Local Geometric Measures
VIS '04 Proceedings of the conference on Visualization '04
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
I/O-efficient computation of water flow across a terrain
Proceedings of the twenty-sixth annual symposium on Computational geometry
A topological sorting algorithm for large graphs
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
We present an I/O-efficient version of an algorithm for simplifying contour trees of two- and three-dimensional scalar fields described by Carr et al. [7]. Our algorithm uses optimal ${\mathcal{O}}(Sort(N))={\mathcal{O}}(\frac{N}{B}\log_{M/B} \frac{N}{B})$ I/Os, where N is the size of the contour tree, M the size of main memory and B the disk block size.