Digital halftoning with space filling curves
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
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
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
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
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
A Laplace transform algorithm for the volume of a convex polytope
Journal of the ACM (JACM)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
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
Towards a theory of cache-efficient algorithms
Journal of the ACM (JACM)
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
Quick-VDR: Interactive View-Dependent Rendering of Massive Models
VIS '04 Proceedings of the conference on Visualization '04
Fast collision detection between massive models using dynamic simplification
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Visibility-Based Prefetching for Interactive Out-Of-Core Rendering
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Multiresolution indexing of triangulated irregular networks
IEEE Transactions on Visualization and Computer Graphics
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Segment-based tetrahedral meshing and rendering
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Streaming Simplification of Tetrahedral Meshes
IEEE Transactions on Visualization and Computer Graphics
Mesh Layouts for Block-Based Caches
IEEE Transactions on Visualization and Computer Graphics
Geometry engine optimization: cache friendly compressed representation of geometry
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Interactive Collision Detection for Deformable Models Using Streaming AABBs
IEEE Transactions on Visualization and Computer Graphics
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
Massive-Model Rendering Techniques: A Tutorial
IEEE Computer Graphics and Applications
Technical strategies for massive model visualization
Proceedings of the 2008 ACM symposium on Solid and physical modeling
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
WSEAS Transactions on Information Science and Applications
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)
Data management for SSDs for large-scale interactive graphics applications
I3D '11 Symposium on Interactive 3D Graphics and Games
Generating raster DEM from mass points via TIN streaming
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Interactive Ray Tracing of Large Models Using Voxel Hierarchies
Computer Graphics Forum
Speculative parallel asynchronous contact mechanics
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
ReduceM: interactive and memory efficient ray tracing of large models
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
Parallel simplification of large meshes on PC clusters
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
Cache-efficient parallel isosurface extraction for shared cache multicores
EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
Data-Parallel Decompression of Triangle Mesh Topology
Computer Graphics Forum
Streaming-enabled parallel dataflow architecture for multicore systems
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
We present a novel method for computing cache-oblivious layouts of large meshes that improve the performance of interactive visualization and geometric processing algorithms. Given that the mesh is accessed in a reasonably coherent manner, we assume no particular data access patterns or cache parameters of the memory hierarchy involved in the computation. Furthermore, our formulation extends directly to computing layouts of multi-resolution and bounding volume hierarchies of large meshes.We develop a simple and practical cache-oblivious metric for estimating cache misses. Computing a coherent mesh layout is reduced to a combinatorial optimization problem. We designed and implemented an out-of-core multilevel minimization algorithm and tested its performance on unstructured meshes composed of tens to hundreds of millions of triangles. Our layouts can significantly reduce the number of cache misses. We have observed 2--20 times speedups in view-dependent rendering, collision detection, and isocontour extraction without any modification of the algorithms or runtime applications.