## Global Static Indexing for Real-time Exploration of Very Large Regular Grids (2001)

### Cached

### Download Links

- [www.sc2001.org]
- [www.pascucci.org]
- [pascucci.org]
- DBLP

### Other Repositories/Bibliography

Citations: | 46 - 7 self |

### BibTeX

@INPROCEEDINGS{Pascucci01globalstatic,

author = {Valerio Pascucci},

title = {Global Static Indexing for Real-time Exploration of Very Large Regular Grids},

booktitle = {},

year = {2001},

publisher = {ACM Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we introduce a new indexing scheme for progressive traversal and visualization of large regular grids. We demonstrate the potential of our approach by providing a tool that displays at interactive rates planar slices of scalar field data with very modest computing resources. We obtain unprecedented results both in terms of absolute performance and, more importantly, in terms of scalability. On a laptop computer we provide real time interaction with a 2048 3 grid (8 Giga-nodes) using only 20MB of memory. On an SGI Onyx we slice interactively an 8192 3 grid ( tera-nodes) using only 60MB of memory. The scheme relies simply on the determination of an appropriate reordering of the rectilinear grid data and a progressive construction of the output slice. The reordering minimizes the amount of I/O performed during the out-of-core computation. The progressive and asynchronous computation of the output provides flexible quality/speed tradeoffs and a timecritical and interruptible user interface. 1.

### Citations

319 | External memory algorithms and data structures: dealing with massive data
- Vitter
(Show Context)
Citation Context ... in-core to the out-of-core processing conditions. The performance degradation is due to the high frequency of I/O operations that may start dominating the overall running time. Out-of-core computing =-=[29]-=- addresses specifically the issues of algorithm redesign and data layout restructuring to enable data access patterns with minimal performance degradation in out-ofcore processing. Results in this are... |

289 | Application of Spatial Data Structures
- Samet
- 1990
(Show Context)
Citation Context ...tions. They improve on the basic data-structure already used for terrain visualization [11][19] or adaptive mesh refinement [26]. The use of the Z-order space filling curve for traversal of quadtrees =-=[28]-=- (also called Morton-order) and has been also proven useful in the speedup of matrix operations allowing them to make better use of the memory cache hierarchies [9][12][29]. In the approach proposed h... |

272 |
Space-Filling Curves
- Sagan
- 1994
(Show Context)
Citation Context ...omputation. In this context space filling curves are often used as a tool to determine very quickly data distribution layouts that guarantee good geometric locality [14][22][24]. Space filling curves =-=[27]-=- have been also used in a wide variety of applications [3] both because of their hierarchical fractal structure as well as for their spatial locality properties. The most popular is the Hilbert curve ... |

238 | urner, "Real-time, continuous level of detail rendering of height fields
- Lindstrom, Koller, et al.
- 1996
(Show Context)
Citation Context ...ions and nearest common ancestors between nodes to allow fast generation of adaptive edge-bisection triangulations. They improve on the basic data-structure already used for terrain visualization [11]=-=[19]-=- or adaptive mesh refinement [26]. The use of the Z-order space filling curve for traversal of quadtrees [28] (also called Morton-order) and has been also proven useful in the speedup of matrix operat... |

224 | ROAMing terrain: real-time optimally adapting meshes
- Duchaineau, Wolinsky, et al.
- 1997
(Show Context)
Citation Context ...elations and nearest common ancestors between nodes to allow fast generation of adaptive edge-bisection triangulations. They improve on the basic data-structure already used for terrain visualization =-=[11]-=-[19] or adaptive mesh refinement [26]. The use of the Z-order space filling curve for traversal of quadtrees [28] (also called Morton-order) and has been also proven useful in the speedup of matrix op... |

121 | External-memory computational geometry
- Goodrich, Tsay, et al.
- 1993
(Show Context)
Citation Context ...e 1: (a-e) The first five levels of resolution of the 2D Lebesgue’s space filling curve. (f-j) The first five levels of resolution of the 3D Lebesgue’s space filling curve. geometric algorithms [1][2]=-=[13]-=-[20] or scientific visualization [4][10]. Closely related issues emerge in the area of parallel and distributed computing where remote data transfer can become the primary bottleneck in the computatio... |

96 |
Über die stetige Abbildung einer Linie auf Flächenstück
- Hilbert
(Show Context)
Citation Context ... have been also used in a wide variety of applications [3] both because of their hierarchical fractal structure as well as for their spatial locality properties. The most popular is the Hilbert curve =-=[15]-=-, which guarantees the best geometric locality properties [23]. The pseudo-Hilbert scanning order [7][8][16] generalizes the scheme to rectilinear grids that have different number of samples along eac... |

83 |
Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- Rivara
- 1984
(Show Context)
Citation Context ... between nodes to allow fast generation of adaptive edge-bisection triangulations. They improve on the basic data-structure already used for terrain visualization [11][19] or adaptive mesh refinement =-=[26]-=-. The use of the Z-order space filling curve for traversal of quadtrees [28] (also called Morton-order) and has been also proven useful in the speedup of matrix operations allowing them to make better... |

76 | Auto-blocking matrix-multiplication or tracking blas3 performance from source code
- FRENS, S
- 1997
(Show Context)
Citation Context ...urve for traversal of quadtrees [28] (also called Morton-order) and has been also proven useful in the speedup of matrix operations allowing them to make better use of the memory cache hierarchies [9]=-=[12]-=-[29]. In the approach proposed here a new data layout is used to allow efficient progressive access to volumetric information stored in external memory. This is achieved by combining interleaved stora... |

73 | I/o optimal isosurface extraction
- Chiang, Silva
- 1997
(Show Context)
Citation Context ...lution of the 2D Lebesgue’s space filling curve. (f-j) The first five levels of resolution of the 3D Lebesgue’s space filling curve. geometric algorithms [1][2][13][20] or scientific visualization [4]=-=[10]-=-. Closely related issues emerge in the area of parallel and distributed computing where remote data transfer can become the primary bottleneck in the computation. In this context space filling curves ... |

49 | Parallel accelerated isocontouring for out-of-core visualization
- Bajaj, Pascucci, et al.
- 1999
(Show Context)
Citation Context ...esolution of the 2D Lebesgue’s space filling curve. (f-j) The first five levels of resolution of the 3D Lebesgue’s space filling curve. geometric algorithms [1][2][13][20] or scientific visualization =-=[4]-=-[10]. Closely related issues emerge in the area of parallel and distributed computing where remote data transfer can become the primary bottleneck in the computation. In this context space filling cur... |

48 | Recursive array layout and fast parallel matrix multiplication
- Chatterjee, Lebeck, et al.
- 1999
(Show Context)
Citation Context ...g curve for traversal of quadtrees [28] (also called Morton-order) and has been also proven useful in the speedup of matrix operations allowing them to make better use of the memory cache hierarchies =-=[9]-=-[12][29]. In the approach proposed here a new data layout is used to allow efficient progressive access to volumetric information stored in external memory. This is achieved by combining interleaved s... |

39 | Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
- Griebel, Zumbusch
- 1999
(Show Context)
Citation Context ...ome the primary bottleneck in the computation. In this context space filling curves are often used as a tool to determine very quickly data distribution layouts that guarantee good geometric locality =-=[14]-=-[22][24]. Space filling curves [27] have been also used in a wide variety of applications [3] both because of their hierarchical fractal structure as well as for their spatial locality properties. The... |

34 | Using spacefilling curves for multi-dimensional indexing
- Lawder, King
- 2000
(Show Context)
Citation Context ...ocality properties [23]. The pseudo-Hilbert scanning order [7][8][16] generalizes the scheme to rectilinear grids that have different number of samples along each coordinate axis. Recently Lawder [17]=-=[18]-=- explored the use of different kinds of space filling curves to develop indexing schemes for data storage layout and fast retrieval in multi-dimensional databases. Balmelli at al. [5][6] use the Z-ord... |

31 | Towards optimal locality in meshindexings
- Niedermeier, Reinhardt, et al.
- 1997
(Show Context)
Citation Context ...the primary bottleneck in the computation. In this context space filling curves are often used as a tool to determine very quickly data distribution layouts that guarantee good geometric locality [14]=-=[22]-=-[24]. Space filling curves [27] have been also used in a wide variety of applications [3] both because of their hierarchical fractal structure as well as for their spatial locality properties. The mos... |

26 | Ahnentafel Indexing into Morton-ordered Arrays, or Matrix Locality for Free - Wise - 2001 |

24 | Quadtrees for embedded surface visualization: Constraints and efficient data structures
- Balmelli, Kovacevic, et al.
- 1999
(Show Context)
Citation Context ...ntly Lawder [17][18] explored the use of different kinds of space filling curves to develop indexing schemes for data storage layout and fast retrieval in multi-dimensional databases. Balmelli at al. =-=[5]-=-[6] use the Z-order space filling curve to navigate efficiently a quad-tree data-structure without using pointers. They use simple, closed formulas for computing neighboring relations and nearest comm... |

22 | On showing lower bounds for external-memory computational geometry problems
- Arge, Miltersen
(Show Context)
Citation Context ...gure 1: (a-e) The first five levels of resolution of the 2D Lebesgue’s space filling curve. (f-j) The first five levels of resolution of the 3D Lebesgue’s space filling curve. geometric algorithms [1]=-=[2]-=-[13][20] or scientific visualization [4][10]. Closely related issues emerge in the area of parallel and distributed computing where remote data transfer can become the primary bottleneck in the comput... |

22 | A common data management infrastructure for adaptive algorithms for PDE solutions
- PARASHAR, BROWNE, et al.
- 1997
(Show Context)
Citation Context ...primary bottleneck in the computation. In this context space filling curves are often used as a tool to determine very quickly data distribution layouts that guarantee good geometric locality [14][22]=-=[24]-=-. Space filling curves [27] have been also used in a wide variety of applications [3] both because of their hierarchical fractal structure as well as for their spatial locality properties. The most po... |

17 | Space filling curves and their use in the design of geometric data structures
- Asano, Ranjan, et al.
- 1997
(Show Context)
Citation Context ...used as a tool to determine very quickly data distribution layouts that guarantee good geometric locality [14][22][24]. Space filling curves [27] have been also used in a wide variety of applications =-=[3]-=- both because of their hierarchical fractal structure as well as for their spatial locality properties. The most popular is the Hilbert curve [15], which guarantees the best geometric locality propert... |

16 | The application of space-filling curves to the storage and retrieval of multidimensional data
- Lawder
- 2000
(Show Context)
Citation Context ...ic locality properties [23]. The pseudo-Hilbert scanning order [7][8][16] generalizes the scheme to rectilinear grids that have different number of samples along each coordinate axis. Recently Lawder =-=[17]-=-[18] explored the use of different kinds of space filling curves to develop indexing schemes for data storage layout and fast retrieval in multi-dimensional databases. Balmelli at al. [5][6] use the Z... |

10 | E cient bundle sorting
- Matias, Segal
- 1998
(Show Context)
Citation Context ... (a-e) The first five levels of resolution of the 2D Lebesgue’s space filling curve. (f-j) The first five levels of resolution of the 3D Lebesgue’s space filling curve. geometric algorithms [1][2][13]=-=[20]-=- or scientific visualization [4][10]. Closely related issues emerge in the area of parallel and distributed computing where remote data transfer can become the primary bottleneck in the computation. I... |

9 |
Eds. External Memory Algorithms and Visualization
- ABELLO, VITTER
- 1999
(Show Context)
Citation Context ... Figure 1: (a-e) The first five levels of resolution of the 2D Lebesgue’s space filling curve. (f-j) The first five levels of resolution of the 3D Lebesgue’s space filling curve. geometric algorithms =-=[1]-=-[2][13][20] or scientific visualization [4][10]. Closely related issues emerge in the area of parallel and distributed computing where remote data transfer can become the primary bottleneck in the com... |

4 | On the Manhattan-distance between points on space-filling meshindexings
- Niedermeier, Sanders
- 1996
(Show Context)
Citation Context ...h because of their hierarchical fractal structure as well as for their spatial locality properties. The most popular is the Hilbert curve [15], which guarantees the best geometric locality properties =-=[23]-=-. The pseudo-Hilbert scanning order [7][8][16] generalizes the scheme to rectilinear grids that have different number of samples along each coordinate axis. Recently Lawder [17][18] explored the use o... |

4 | Hierarchical indexing for out-of-core access to multi-resolution data
- Pascucci, Frank
- 2001
(Show Context)
Citation Context ...ogressive traversal. The layout is coupled with a simple mapping of the 3D index (i, j, k) of an element in the grid to its 1D index I on disk. This new mapping improves on the approach introduced in =-=[25]-=- by using a conceptual 2 n tree decomposition instead of a binary tree. The scheme has three key features that make it particularly attractive. First the order of the data is independent of the out-of... |

3 | Solving the coplanarity problem of regular embedded triangulations
- Balmelli, Kovačević, et al.
- 1999
(Show Context)
Citation Context ...y Lawder [17][18] explored the use of different kinds of space filling curves to develop indexing schemes for data storage layout and fast retrieval in multi-dimensional databases. Balmelli at al. [5]=-=[6]-=- use the Z-order space filling curve to navigate efficiently a quad-tree data-structure without using pointers. They use simple, closed formulas for computing neighboring relations and nearest common ... |

3 |
An address generator for a 3-dimensional pseudo-hilbert scan in a cuboid region
- BANDOU, KAMATA
- 1999
(Show Context)
Citation Context ...structure as well as for their spatial locality properties. The most popular is the Hilbert curve [15], which guarantees the best geometric locality properties [23]. The pseudo-Hilbert scanning order =-=[7]-=-[8][16] generalizes the scheme to rectilinear grids that have different number of samples along each coordinate axis. Recently Lawder [17][18] explored the use of different kinds of space filling curv... |

3 |
An address generator for an n-dimensional pseudo-hilbert scan in a hyper-rectangular parallelepiped region
- Bandou, Kamata
- 2000
(Show Context)
Citation Context ...ucture as well as for their spatial locality properties. The most popular is the Hilbert curve [15], which guarantees the best geometric locality properties [23]. The pseudo-Hilbert scanning order [7]=-=[8]-=-[16] generalizes the scheme to rectilinear grids that have different number of samples along each coordinate axis. Recently Lawder [17][18] explored the use of different kinds of space filling curves ... |

3 |
An address generator of a pseudo-hilbert scan in a rectangle region
- KAMATA, BANDOU
- 1997
(Show Context)
Citation Context ...ure as well as for their spatial locality properties. The most popular is the Hilbert curve [15], which guarantees the best geometric locality properties [23]. The pseudo-Hilbert scanning order [7][8]=-=[16]-=- generalizes the scheme to rectilinear grids that have different number of samples along each coordinate axis. Recently Lawder [17][18] explored the use of different kinds of space filling curves to d... |

3 | Performance of large-scale scientific applications on the IBM ASCI blue-pacific system
- Mirin
- 1999
(Show Context)
Citation Context ...e datasets using moderate resources. On a laptop computer we provide real time interaction with a grid of 2048 3 using only 20MB of cache memory. Until recently real time navigation with this dataset =-=[21]-=- was only possible on a large multiprocessor systems, limiting interaction to the computation of orthogonal slices and requiring the duplication of the data for each slicing direction. With the new ap... |