An efficient range search algorithm for visualizing extrema of volume data

Authors:
Xiaolin Wu;Yonggang Fang
Affiliations:
University of Western Ontario, London, Ontario, Canada;Tsinghua University, Beijing, P.R.China
Venue:
VIS '92 Proceedings of the 3rd conference on Visualization '92
Year:
1992

Citing 4
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Computational geometry: an introduction

Computational geometry: an introduction
Functional approach to data structures and its use in multidimensional searching

SIAM Journal on Computing
Partitioning space for range queries

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents a new, fast range search algorithm for visualizing extrema of d-dimensional volume data in real time as the user interactively moves the query range. The new algorithm is based on an efficient data structure, called index heap, which needs only O(N/logN) space and O(d2dN) preprocessing time to be set up, where N is the size of d-dimensional data volume. The algorithm can answer an extremum query in O(4d) expected time and its worst case time complexity is O(2d log N) per query. For dimensions two and three, we can consider that the range search for extrema is effected in average O(1) time per query independent of the size of query range. Unlike the present range query algorithms in the computational geometry literature, the proposed algorithm is very simple and can be easily implemented by practitioners.