Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Christian Bouville"'
Publikováno v:
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics, Institute of Electrical and Electronics Engineers, In press, pp.1-1. ⟨10.1109/TVCG.2019.2952131⟩
IEEE Transactions on Visualization and Computer Graphics, In press, pp.1-1. ⟨10.1109/TVCG.2019.2952131⟩
IEEE Transactions on Visualization and Computer Graphics, Institute of Electrical and Electronics Engineers, In press, pp.1-1. ⟨10.1109/TVCG.2019.2952131⟩
IEEE Transactions on Visualization and Computer Graphics, In press, pp.1-1. ⟨10.1109/TVCG.2019.2952131⟩
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, amo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6b62e1debce977b8f08cb41881ad551
https://hal.inria.fr/hal-02476491
https://hal.inria.fr/hal-02476491
Rendering photorealistic images is a costly process which can take up to several days in the case of high quality images. In most cases, the task of sampling the incident radiance function to evaluate the illumination integral is responsible for an i
Publikováno v:
Synthesis Lectures on Computer Graphics and Animation ISBN: 9783031795664
Rendering photorealistic images is a costly process which can take up to several days in the case of high quality images. In most cases, the task of sampling the incident radiance function to evaluate the illumination integral is responsible for an i
Publikováno v:
Computer Graphics Forum. 32:134-143
Quasi-Monte Carlo (QMC) methods exhibit a faster convergence rate than that of classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis, where it is frequently used for approximating the value of spherical integrals (e.g. i
Autor:
Christian Bouville, Jaroslav Křivánek, Kadi Bouatouch, Mickaël Ribardière, Václav Gassenbauer
Publikováno v:
Computer Graphics Forum
Computer Graphics Forum, Wiley, 2011, 30 (7), ⟨10.1111/j.1467-8659.2011.02047.x⟩
Computer Graphics Forum, 2011, 30 (7), ⟨10.1111/j.1467-8659.2011.02047.x⟩
Computer Graphics Forum, Wiley, 2011, 30 (7), ⟨10.1111/j.1467-8659.2011.02047.x⟩
Computer Graphics Forum, 2011, 30 (7), ⟨10.1111/j.1467-8659.2011.02047.x⟩
International audience; Local Principal Component Analysis (LPCA) is one of the popular techniques for dimensionality reduction and data compression of large data sets encountered in computer graphics. The LPCA algorithm is a variant of k-means clust
Publikováno v:
Synthesis Lectures on Computer Graphics and Animation ISBN: 9783031795664
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e6ce61403d6b6364acea639d1f41bc
https://doi.org/10.1007/978-3-031-79567-1_3
https://doi.org/10.1007/978-3-031-79567-1_3
Publikováno v:
Synthesis Lectures on Computer Graphics and Animation ISBN: 9783031795664
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2bc2a294611cf010fe0d007e079f286
https://doi.org/10.1007/978-3-031-79567-1_1
https://doi.org/10.1007/978-3-031-79567-1_1
Publikováno v:
Synthesis Lectures on Computer Graphics and Animation ISBN: 9783031795664
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d5076a76b8c4015ae2de42d1df86620
https://doi.org/10.1007/978-3-031-79567-1_2
https://doi.org/10.1007/978-3-031-79567-1_2
Publikováno v:
Annales Des Télécommunications. 60:1394-1421
This paper describes a novel progressive and hierarchical representation for densely built urban areas. It aims at navigating through huge urban environments with network-based client-server systems. Thanks to this method, navigation is no longer lim
Real-Time Reconstruction of Wavelet-Encoded Meshes for View-Dependent Transmission and Visualization
Publikováno v:
IEEE Transactions on Circuits and Systems for Video Technology. 14:1009-1020
Wavelet methods for geometry encoding is a recently emerged superset of multiresolution analysis which has proven to be very efficient in terms of compression and adaptive transmission of three-dimensional (3-D) content. The decorrelating power and s