Name
Abstract | ||
|---|---|---|
Spherical Fibonacci point sets yield nearly uniform point distributions on the unit sphere S2 ⊂ R3. The forward generation of these point sets has been widely researched and is easy to implement, such that they have been used in various applications. Unfortunately, the lack of an efficient mapping from points on the unit sphere to their closest spherical Fibonacci point set neighbors rendered them impractical for a wide range of applications, especially in computer graphics. Therefore, we introduce an inverse mapping from points on the unit sphere which yields the nearest neighbor in an arbitrarily sized spherical Fibonacci point set in constant time, without requiring any precomputations or table lookups. We show how to implement this inverse mapping on GPUs while addressing arising floating point precision problems. Further, we demonstrate the use of this mapping and its variants, and show how to apply it to fast unit vector quantization. Finally, we illustrate the means by which to modify this inverse mapping for texture mapping with smooth filter kernels and showcase its use in the field of procedural modeling. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2816795.2818131 | ACM Transactions on Graphics |
Keywords | Field | DocType |
spherical Fibonacci,inverse mapping,constant time | Texture mapping,Mathematical optimization,Procedural modeling,Floating point,Computer science,Fibonacci search technique,Quantization (signal processing),Unit vector,Unit sphere,Fibonacci number | Journal |
Volume | Issue | ISSN |
34 | 6 | 0730-0301 |
Citations | PageRank | References |
12 | 0.66 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Keinert | 1 | 35 | 5.44 |
| Matthias Innmann | 2 | 46 | 2.48 |
| Michael Sänger | 3 | 12 | 0.66 |
| Marc Stamminger | 4 | 1465 | 112.74 |