Cache-oblivious mesh layouts

ACM Transactions on Graphics

Volumn 24, Issue 3, 2005, Pages 886-893

  Yoon, Sung Eui ^a   Lindstrom, Peter ^b   Pascucci, Valerio ^b   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE PARAMETERS; CACHE-OBLIVIOUS MESH LAYOUTS; DATA ACCESS PATTERNS; GEOMETRIC PROCESSING ALGORITHMS; MEMORY HIERARCHY;

ALGORITHMS; DATA ACQUISITION; GEOMETRY; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING; VISUALIZATION;

CACHE MEMORY;

EID: 33646072494     PISSN: 07300301     EISSN: 07300301     Source Type: Conference Proceeding    
DOI: 10.1145/1073204.1073278     Document Type: Conference Paper

References (36)

1. ARGE, L., BRODAL, G., AND FAGERBERG, R. 2004. Cache oblivious data structures. Handbook on Data Structures and Applications.
2. BARTHOLDI, J., AND GOLDSMAN, P. 2004. Multiresolution indexing of triangulated irregular networks. In IEEE Transaction on Visualization and Computer Graphics, 484-495.
3. BOGOMJAKOV, A., AND GOTSMAN, C. 2002. Universal rendering sequences for transparent vertex caching of progressive meshes. In Computer Graphics Forum, 137-148.
4. ClGNONI, P., MONTANI, C., ROCCHINI, C., AND SCOPIGNO, R. 2003. External memory management and simplification of huge meshes. In IEEE Transaction on Visualization and Computer Graphics, 525-537.
5. COLEMAN, S., AND McKINLEY, K. 1995. Tile size selection using cache organization and data layout. SIGPLAN Conference on Programming Language Design and Implementation, 279-290.
6. CORRÊA, W. T., KLOSOWSKI, J. T., AND SILVA, C. T. 2003. Visibility-based prefetching for interactive out-of-core rendering. In Proceedings of PVG 2003 (6th IEEE Symposium on Parallel and Large-Data Visualization and Graphics), 1-8.
7. DEERING, M. F. 1995. Geometry compression. In SIGGRAPH 95 Conference Proceedings, Addison Wesley, R. Cook, Ed., Annual Conference Series, ACM SIGGRAPH, 13-20. held in Los Angeles, California, 06-11 August 1995.
8. DIAZ, J., PETIT, J., AND SERNA, M. 2002. A survey on graph layout problems. ACM Computing Surveys 34, 313-356.
9. FRANQUESA-NIUBO, M., AND BRUNET, P. 2003. Collision prediction using mktrees. Proc. CEIG, 217-232.
10. FRIGO, M., LEISERSON, C., PROKOP, H., AND RAMACHANDRAN, S. 1999. Cacheoblivious algorithms. Symposium on Foundations of Computer Science, 285-297.
11. GAREY, M. R., JOHNSON, D., AND STOCKMEYER, L. 1976. Some simplified np-complete graph problems. Theoretical Computer Science 1, 237-267.
12. GOPI, M., AND EPPSTEIN, D. 2004. Single-strip triangulation of manifolds with arbitrary topology. In EUROGRAPHICS, 371-379.
13. GOTTSCHALK, S., LIN, M., AND MANOCHA, D. 1996. OBB-Tree: A hierarchical structure for rapid interference detection. Proc. of ACM Siggraph'96, 171-180.
14. HEBER, G., BISWAS, R., AND GAO, G. 2000. Self-avoiding walks over adaptive unstructured grids. In Concurrency: Practice and Experience, 85-109.
15. HOPPE, H. 1999. Optimization of mesh locality for transparent vertex caching. Proc. of ACM SIGGRAPH, 269-276.
16. ISENBURG, M., AND GUMHOLD, S. 2003. Out-of-core compression for gigantic polygon meshes. In ACM Trans. on Graphics (Proc. of ACM SIGGRAPH), vol. 22, 935-942.
17. ISENBURG, M., AND LINDSTROM, P. 2004. Streaming meshes. Tech. Rep. UCRL-CONF-201992, LLNL.
18. 5) time algorithm for volumes of convex sets. Random Structures and Algorithms, 1-50.
19. KARNI, Z., BOGOMJAKOV, A., AND GOTSMAN, C. 2002. Efficient compression and rendering of multi-resolution meshes. In IEEE Visualization, 347-354.
20. KARYPIS, G., AND KUMAR, V. 1998. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 96-129.
21. LASSERRE, J. B., AND ZERON, E. S. 2001. A laplace transform algorithm for the volume of a convex polytope. Journal of the ACM, 1126-1140.
22. LIN, M., AND MANOCHA, D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.
23. LINDSTROM, P., AND PASCUCCI, V. 2001. Visualization of large terrains made easy. IEEE Visualization, 363-370.
24. OLIKER, L., LI, X., HUSBANDS, P., AND BISWAS, R. 2002. Effects of ordering strategies and programming paradigms on sparse matrix computations. In SIAM Review, 373-393.
25. PASCUCCI, V., AND FRANK, R. J. 2001. Global static indexing for real-time exploration of very large regular grids. Super Computing, 225-241.
26. RUSINKIEWICZ, S., AND LEVOY, M. 2000. Qsplaf. A multiresolution point rendering system for large meshes. Proc. of ACM SIGGRAPH, 343-352.
27. SAGAN, H. 1994. Space-Filling Curves. Springer-Verlag.
28. SEN, S., CHATTERJEE, S., AND DUMIR, N. 2002. Towards a theory of cache-efficient algorithms. Journal of the ACM 49, 828-858.
29. SILVA, C., CHIANO, Y.-J., CORREA, W., EL-SANA, J., AND LINDSTROM, P. 2002. Out-of-core algorithms for scientific visualization and computer graphics. Visualization '02 Course Notes.
30. VAN KREVELD, M., VAN OOSTRUM, R., BAJAJ, C., PASCUCCI, V., AND SCHIKORE, D. R. 1997. Contour trees and small seed sets for isosurface traversal. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), ACM Press, New York, 212-220.
31. VELHO, L., AND GOMES, J. D. 1991. Digital halftoning with space filling curves. In Computer Graphics (SIGGRAPH '91 Proceedings), T. W. Sederberg, Ed., vol. 25, 81-90.
32. VITTER, J. 2001. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 209-271.
33. WILSON, A., LARSEN, E., MANOCHA, D., AND LIN, M. C. 1999. Partitioning and handling massive models for interactive collision detection. Computer Graphics Forum (Proc. of Eurographics) 18, 3, 319-329.
34. YOON, S.-E., AND MANOCHA, D. 2005. Cache-Oblivious Layouts of Bounding Volume Hierarchies. Tech. rep., University of North Carolina-Chapel Hill.
35. YOON, S., SALOMON, B., LIN, M. C., AND MANOCHA, D. 2004. Fast collision detection between massive models using dynamic simplification. Eurographics Symposium on Geometry Processing, 136-146.
36. YOON, S.-E., SALOMON, B., GAYLE, R., AND MANOCHA, D. 2004. Quick-VDR: Interactive View-dependent Rendering of Massive Models. IEEE Visualization, 131-138.