Global Static Indexing for Real-time Exploration of Very Large Regular Grids

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2001, Pages 2-

  Pascucci, Valerio ^a   Frank, Randall J ^a  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); USER INTERFACES;

ABSOLUTE PERFORMANCE; COMPUTING RESOURCE; FIELD DATA; GIGAS; INDEXING SCHEME; INTERACTIVE RATES; REAL TIME INTERACTIONS; REAL- TIME; REGULAR GRIDS; SCALAR FIELDS;

LAPTOP COMPUTERS;

EID: 84903711568     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/582034.582036     Document Type: Conference Paper

References (30)

1. Abello, J., and Vitter, J. S., (eds.). External Memory Algorithms and Visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society Press, Providence, RI, 1999.
2. Arge, L., and Miltersen, P. B., On showing lower bounds for external-memory computational geometry problems. In Abello, J., and Vitter, J. S., editors, External Memory Algorithms and Visualization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society Press, Providence, RI, 1999.
3. Asano, T., Ranjan, D., Roos, T., and Welzl, E., Space filling curves and their use in the design of geometric data structures. Lecture Notes in Computer Science, 911: 36-44, 1995.
4. Bajaj, C. L., Pascucci, V., Thompson, D., and Zhang, X. Y., Parallel accelerated isocontouring for out-of-core visualization. In Spencer, S. N., editor, Proceedings of the 1999 IEEE Parallel Visualization and Graphics Symposium (PVGS'99), pages 97-104, N. Y., October 25-26 1999. ACM Siggraph.
5. Balmelli, L., Kovacevic, J., and Vetterli, M., Quadtree for embedded surface visualization: Constraints and efficient data structures. In IEEE International Conference on Image Processing (ICIP), Kobe Japan, October 1999.
6. Balmelli, L., Kovacevic, J., and Vetterli, M., Solving the coplanarity problem of regular embedded triangulations. In Proceedings of the Workshop on Vision, Modeling and Visualization, November 1999.
7. Bandou, Y., and Kamata, S. I., An address generator for a 3-dimensional pseudo-hilbert scan in a cuboid region. In International Conference on Image Processing, ICIP99, volume I, 1999.
8. Bandou, Y., and Kamata, S. I., An address generator for an n-dimensional pseudo-hilbert scan in a hyper-rectangular parallelepiped region. In International Conference on Image Processing, ICIP 2000, 2000. To appear.
9. Chatterjee, S., Lebeck, A. R., Patnala, P. K., and Thottethodi, M., Recursive array layouts and fast parallel matrix multiplication. In Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 222-231, Saint-Malo, France, June 27-30, 1999. SIGACT/SIGARCH and EATCS.
10. Chiang, Y. J., and Silva, C. T., I/O optimal isosurface extraction. In Yagel, R., and Hagen, H., editors, IEEE Visualization'97, pages 293-300. IEEE, November 1997.
11. Duchaineau, M. A., Wolinsky, M., Sigeti, D. E., Miller, M. C., Aldrich, C., and Mineev-Weinstein, M. B., Roaming terrain: Real-time optimally adapting meshes. IEEE Visualization '97, pages 81-88, November 1997.
12. Frens, J. D., and Wise, D. S., Auto-blocking matrixmultiplication or tracking BLAS3 performance from source code. ACM SIGPLAN Notices, 32 (7): 206-216, July 1997.
13. Goodrich, M. T., Tsay, J. J., Vengroff, D. E., and Vitter, J. S., External-memory computational geometry. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS '93), Palo Alto, CA, November 1993.
14. Griebel, M., and Zumbusch, G. W., Parallel multigrid in an adaptive pde solver based on hashing and space-filling curves. 25: 827: 843, 1999.
15. Hilbert, D., Über die stetige abbildung einer linie auf ein flachenstück. Mathematische Annalen, 38: 459-460, 1891.
16. Kamata, S. I., and Bandou, Y., An address generator of a pseudo-hilbert scan in a rectangle region. In International Conference on Image Processing, ICIP97, volume I, pages 707-714, 1997.
17. Lawder, J. K., The Application of Space-filling Curves to the Storage and Retrieval of Multi-Dimensional Data. PhD thesis, School of Computer Science and Information Systems, Birkbeck College, University of London, 2000.
18. Lawder, J. K., and King, P. J. H., Using space-filling curves for multi-dimensional indexing. In Brian Lings and Keith Jeffery, editors, proceedings of the 17th British National Conference on Databases (BNCOD 17), volume 1832 of Lecture Notes in Computer Science, pages 20-35. Springer Verlag, July 2000.
19. Lindstrom, P., Koller, D., Ribarsky, W., Hughes, L. F., Faust, N., and Turner, G., Real-time, continuous level of detail rendering of height fields. Proceedings of SIGGRAPH 96, pages 109-118, August 1996.
20. Matias, Y., Segal, E., and Vitter, J. S., Efficient bundle sorting. In Proceedings of the 11th Annual SIAM/ACM Symposium on Discrete Algorithms (SODA '00), January 2000.
21. Mirin, A., Performance of large-scale scientific applications on the IBM ASCI blue-pacific system. In Ninth SIAM Conf. of Parallel Processing for Scientific Computing, Philadelphia, Mar 1999. SIAM. CD-ROM.
22. Niedermeier, R., Reinhardt, K., and Sanders, P., Towards optimal locality in meshindexings, 1997.
23. Niedermeier, R., and Sanders, P., On the manhattandistance between points on space-filling mesh-indexings. Technical Report iratr-1996-18, Universität Karlsruhe, Informatik für Ingenieure und Naturwissenschaftler, 1996.
24. Parashar, M., Browne, J. C., Edwards, C., and Klimkowski, K., A common data management infrastructure for adaptive algorithms for pde solutions. In SuperComputing 97, 1997.
25. Pascucci, V., and Frank, R. J., Hierarchical indexing for out-of-core access to multi-resolution data. Technical Report UCRL-JC-140581, Lawrence Livermore National Laboratory, 2001. A preliminary version was presented at the Lake Tahoe Workshop NSF/DOE Lake Tahoe Workshop on Hierarchical Approximation and Geometrical Methods for Scientific Visualization.
26. Rivara, M. C., Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. International Journal for Numerical Methods in Engineering, 20: 745-756, 1984.
27. Sagan, H., Space-Filling Curves. Springer-Verlag, New York, NY, 1994.
28. Samet, H., Applications of Spatial Data Structures. Addison-Wesley, Reading, Mass., 1990. chapter on ray tracing and efficiency, also discusses radiosity.
29. Vitter, J. S., External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, March 2000.
30. Wise, D. S., Ahnentafel indexing into Morton-ordered arrays, or matrix locality for free. In Euro-Par 2000-Parallel Processing, volume 1900 of Lecture Notes in Computer Science, pages 774-784. Springer, August 2000.