Introduction to algorithms
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Surfels: surface elements as rendering primitives
Proceedings of the 27th 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
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Computer Architecture: Concepts and Evolution
Computer Architecture: Concepts and Evolution
Efficient high quality rendering of point sampled geometry
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
Modeling and Rendering of Points with Local Geometry
IEEE Transactions on Visualization and Computer Graphics
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
ACM SIGGRAPH 2003 Papers
Progressive point set surfaces
ACM Transactions on Graphics (TOG)
High-Quality Point-Based Rendering on Modern GPUs
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Brook for GPUs: stream computing on graphics hardware
ACM SIGGRAPH 2004 Papers
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Merrimac: Supercomputing with Streams
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
A Frequency-Sensitive Point Hierarchy for Images and Volumes
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
ACM SIGGRAPH 2002 conference abstracts and applications
Compressing large boolean matrices using reordering techniques
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Subquadratic algorithms for 3SUM
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
A survey of visibility for walkthrough applications
IEEE Transactions on Visualization and Computer Graphics
An FFT-based technique for translation, rotation, and scale-invariant image registration
IEEE Transactions on Image Processing
Hi-index | 0.00 |
Recent trends in parallel computer architecture strongly suggest the need to improve the arithmetic intensity (the compute to bandwidth ratio) for greater performance in time-critical applications, such as interactive 3D graphics. At the same time, advances in stream programming abstraction for graphics processors (GPUs) have enabled us to use parallel algorithm design methods for GPU programming. Inspired by these developments, this paper explores the interactions between multiple data streams to improve arithmetic intensity and address the input geometry bandwidth bottleneck for interactive 3D graphics applications. We introduce the idea of creating vertex and transformation streams that represent large point datasets via their interaction. We discuss how to factor such point datasets into a set of source vertices and transformation streams by identifying the most common translations amongst vertices. We accomplish this by identifying peaks in the cross-power spectrum of the dataset in the Fourier domain. We validate our approach by integrating it with a view-dependent point rendering system and show significant improvements in input geometry bandwidth requirements as well as rendering frame rates.