default search action
Jacopo Pantaleoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j7]Daqi Lin, Markus Kettunen
, Benedikt Bitterli, Jacopo Pantaleoni, Cem Yuksel, Chris Wyman:
Generalized resampled importance sampling: foundations of ReSTIR. ACM Trans. Graph. 41(4): 75:1-75:23 (2022) - 2021
- [j6]Yaobin Ouyang, Shiqiu Liu, Markus Kettunen
ReSTIR GI: Path Resampling for Real-Time Path Tracing. Comput. Graph. Forum 40(8): 17-29 (2021) - [j5]Markus Kettunen
An unbiased ray-marching transmittance estimator. ACM Trans. Graph. 40(4): 137:1-137:20 (2021) - [i7]Markus Kettunen, Eugene d'Eon, Jacopo Pantaleoni, Jan Novák:
An unbiased ray-marching transmittance estimator. CoRR abs/2102.10294 (2021) - 2020
- [j4]Jacopo Pantaleoni
Online Path Sampling Control with Progressive Spatio-temporal Filtering. SN Comput. Sci. 1(5): 279 (2020) - [i6]Jacopo Pantaleoni:
Online path sampling control with progressive spatio-temporal filtering. CoRR abs/2005.07547 (2020)
2010 – 2019
- 2019
- [i5]Jacopo Pantaleoni:
Blue-Noise Dithered QMC Hierarchical Russian Roulette. CoRR abs/1907.12343 (2019) - [i4]Jacopo Pantaleoni:
Importance Sampling of Many Lights with Reinforcement Lightcuts Learning. CoRR abs/1911.10217 (2019) - 2018
- [c4]Chakravarty Reddy Alla Chaitanya, Laurent Belcour, Toshiya Hachisuka, Simon Premoze, Jacopo Pantaleoni, Derek Nowrouzezahrai:
Matrix Bidirectional Path Tracing. EGSR (EI&I) 2018: 23-32 - 2017
- [j3]Jacopo Pantaleoni:
Charted metropolis light transport. ACM Trans. Graph. 36(4): 75:1-75:14 (2017) - [i3]Jacopo Pantaleoni, Eric Heitz:
Notes on optimal approximations for importance sampling. CoRR abs/1707.08358 (2017) - 2016
- [i2]Jacopo Pantaleoni:
Charted Metropolis Light Transport. CoRR abs/1612.05395 (2016) - 2014
- [i1]Jacopo Pantaleoni:
A massively parallel algorithm for constructing the BWT of large string sets. CoRR abs/1410.0562 (2014) - 2012
- [j2]Toshiya Hachisuka, Jacopo Pantaleoni, Henrik Wann Jensen:
A path space extension for robust light transport simulation. ACM Trans. Graph. 31(6): 191:1-191:10 (2012) - [e2]Carsten Dachsbacher, Jacob Munkberg, Jacopo Pantaleoni:
Proceedings of the EUROGRAPHICS Conference on High Performance Graphics 2012, Paris, France, June 25-27, 2012. Eurographics Association 2012, ISBN 978-3-905674-41-5 [contents] - 2011
- [c3]Kirill Garanzha, Jacopo Pantaleoni, David K. McAllister:
Simpler and Faster HLBVH with Work Queues. High Performance Graphics 2011: 59-64 - [c2]Jacopo Pantaleoni:
VoxelPipe: A Programmable Pipeline for 3D Voxelization. High Performance Graphics 2011: 99-106 - [e1]Carsten Dachsbacher, William Mark, Jacopo Pantaleoni:
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on High Performance Graphics 2011, Vancouver, Canada, August 5-7, 2011. ACM 2011, ISBN 978-1-4503-0896-0 [contents] - 2010
- [j1]Jacopo Pantaleoni, Luca Fascione, Martin Hill, Timo Aila:
PantaRay: fast ray-traced occlusion caching of massive scenes. ACM Trans. Graph. 29(4): 37:1-37:10 (2010) - [c1]Jacopo Pantaleoni, David Luebke:
HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry. High Performance Graphics 2010: 87-95
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: