Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A cellular texture basis function
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multidimensional access methods
ACM Computing Surveys (CSUR)
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
Faster photon map global illumination
Journal of Graphics Tools
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Realistic image synthesis using photon mapping
Realistic image synthesis using photon mapping
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
Ray tracing on programmable graphics hardware
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
SaarCOR: a hardware architecture for ray tracing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Introduction to Algorithms
Interactive global illumination using fast ray tracing
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
IEEE Computer Graphics and Applications
DOT: A Spatial Access Method Using Fractals
Proceedings of the Seventh International Conference on Data Engineering
Proceedings of the Second International Conference on Data Engineering
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The ANN-tree: An Index for Efficient Approximate Nearest Neighbor Search
DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
Ray Tracing Point Sampled Geometry
Proceedings of the Eurographics Workshop on Rendering Techniques 2000
A Hashing Strategy for Efficient k -Nearest Neighbors Computation
CGI '99 Proceedings of the International Conference on Computer Graphics
Photon mapping on programmable graphics hardware
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Reordering for cache conscious photon mapping
GI '05 Proceedings of Graphics Interface 2005
Interactive image-space techniques for approximating caustics
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Photon mapping on programmable graphics hardware
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
A ray tracing solution for diffuse interreflection
ACM SIGGRAPH 2007 courses
Compressed lossless texture representation and caching
GH '06 Proceedings of the 21st ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Light field propagation and rendering on the GPU
AFRIGRAPH '07 Proceedings of the 5th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Reducing Photon-Mapping Bandwidth by Query Reordering
IEEE Transactions on Visualization and Computer Graphics
Radiance cache splatting: a GPU-friendly global illumination algorithm
ACM SIGGRAPH 2008 classes
A hardware processing unit for point sets
Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Hardware-accelerated global illumination by image space photon mapping
Proceedings of the Conference on High Performance Graphics 2009
The State of the Art in Interactive Global Illumination
Computer Graphics Forum
Realtime caustics using distributed photon mapping
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Interactive global photon mapping
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Radiance cache splatting: a GPU-friendly global illumination algorithm
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
kANN on the GPU with shifted sorting
EGGH-HPG'12 Proceedings of the Fourth ACM SIGGRAPH / Eurographics conference on High-Performance Graphics
Boolean operations on surfel-bounded solids using programmable graphics hardware
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Toward practical real-time photon mapping: efficient GPU density estimation
Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
| Hi-index | 0.00 |
For hardware accelerated rendering, photon mapping is especially useful for simulating caustic lighting effects on non-Lambertian surfaces. However, an efficient hardware algorithm for the computation of the k nearest neighbours to a sample point is required.Existing algorithms are often based on recursive spatial subdivision techniques, such askd-trees. However, hardware implementation of a tree-based algorithm would have a high latency, or would require a large cache to avoid this latency on average.We present a neighbourhood-preserving hashing algorithm that is low-latency and has sub-linear access time. This algorithm is more amenable to fine-scale parallelism than tree-based recursive spatial subdivision, and maps well onto coherent block-oriented pipelined memory access. These properties make the algorithm suitable for implementation using future programmable fragment shaders with only one stage of dependent texturing.