Extensible spherical Fibonacci grids

Spherical Fibonacci grids (SFG) yield extremely uniform point set distributions on the sphere. This feature makes SFGs particularly well-suited to a wide range of computer graphics applications, from numerical integration, to vector quantization, among others. However, the application of SFGs to pro...

Descripción completa

Detalles Bibliográficos
Autores: Marques, Ricardo, Bouville, Christian, Bouatouch, Kadi, Blat, Josep
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2021
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10230/56016
Acceso en línea:http://hdl.handle.net/10230/56016
http://dx.doi.org/10.1109/TVCG.2019.2952131
Access Level:acceso abierto
Palabra clave:spherical quasi-Monte Carlo
low discrepancy spherical point sets
adaptive sampling
rendering equation
Descripción
Sumario:Spherical Fibonacci grids (SFG) yield extremely uniform point set distributions on the sphere. This feature makes SFGs particularly well-suited to a wide range of computer graphics applications, from numerical integration, to vector quantization, among others. However, the application of SFGs to problems in which further refinement of an initial point set is required is currently not possible. This is because there is currently no solution to the problem of adding new points to an existing SFG while maintaining the point set properties. In this work, we fill this gap by proposing the extensible spherical Fibonacci grids (E-SFG). We start by carrying out a formal analysis of SFGs to identify the properties which make these point sets exhibit a nearly-optimal uniform spherical distribution. Then, we propose an algorithm (E-SFG) to extend the original point set while preserving these properties. Finally, we compare the E-SFG with a other extensible spherical point sets. Our results show that the E-SFG outperforms spherical point sets based on a low discrepancy sequence both in terms of spherical cap discrepancy and in terms of root mean squared error for evaluating the rendering integral.