Tile size selection using cache organization and data layout
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Optimizing triangle strips for fast rendering
Proceedings of the 7th conference on Visualization '96
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Optimization of mesh locality for transparent vertex caching
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Optimal linear arrangement of a rectangular grid
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Global static indexing for real-time exploration of very large regular grids
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Visualization of large terrains made easy
Proceedings of the conference on Visualization '01
Efficient compression and rendering of multi-resolution meshes
Proceedings of the conference on Visualization '02
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Quick-VDR: Interactive View-Dependent Rendering of Massive Models
VIS '04 Proceedings of the conference on Visualization '04
ACM SIGGRAPH 2005 Papers
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
ACM Transactions on Algorithms (TALG)
Geometry engine optimization: cache friendly compressed representation of geometry
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Fast triangle reordering for vertex locality and reduced overdraw
ACM SIGGRAPH 2007 papers
Efficient data reduction and cache-coherent techniques toward real-time performance
ACM SIGGRAPH 2007 courses
Efficient reduction of access latency through object correlations in virtual environments
EURASIP Journal on Applied Signal Processing
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Technical strategies for massive model visualization
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Cache-oblivious databases: Limitations and opportunities
ACM Transactions on Database Systems (TODS)
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
A novel page-based data structure for interactive walkthroughs
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Cache-oblivious ray reordering
ACM Transactions on Graphics (TOG)
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Data management for SSDs for large-scale interactive graphics applications
I3D '11 Symposium on Interactive 3D Graphics and Games
A general method for modeling on irregular grids
International Journal of High Performance Computing Applications
Out-of-core simplification and crack-free LOD volume rendering for irregular grids
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Current computer architectures employ caching to improve the performance of a wide variety of applications.One of the main characteristics of such cache schemes is the use of block fetching whenever an uncached data element is accessed.To maximize the benefit of the block fetching mechanism, we present novel cache-aware and cache-oblivious layouts of surface and volume meshes that improve the performance of interactive visualization and geometric processing algorithms. Based on a general I/O model, we derive new cache-aware and cache-oblivious metrics that have high correlations with the number of cache misses when accessing a mesh.In addition to guiding the layout process, our metrics can be used to quantify the quality of a layout, e.g. for comparing different layouts of the same mesh and for determining whether a given layout is amenable to significant improvement. We show that layouts of unstructured meshes optimized for our metrics result in improvements over conventional layouts in the performance of visualization applications such as isosurface extraction and view-dependent rendering. Moreover, we improve upon recent cache-oblivious mesh layouts in terms of performance, applicability, and accuracy.