default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Grittmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Pascal Grittmann:
Rethinking multiple importance sampling for general and efficient Monte Carlo rendering. Saarland University, Saarbrücken, Germany, 2023- [j8]Qingqin Hua
, Pascal Grittmann, Philipp Slusallek:
Revisiting controlled mixture sampling for rendering applications. ACM Trans. Graph. 42(4): 64:1-64:13 (2023) - [c2]Misa Korac, Corentin Salaün, Iliyan Georgiev, Pascal Grittmann, Philipp Slusallek, Karol Myszkowski, Gurprit Singh:
Perceptual error optimization for Monte Carlo animation rendering. SIGGRAPH Asia 2023: 89:1-89:10 - [i1]Misa Korac, Corentin Salaün, Iliyan Georgiev, Pascal Grittmann, Philipp Slusallek, Karol Myszkowski, Gurprit Singh:
Perceptual error optimization for Monte Carlo animation rendering. CoRR abs/2310.02955 (2023) - 2022
- [j7]Pascal Grittmann, Ömercan Yazici, Iliyan Georgiev, Philipp Slusallek:
Efficiency-aware multiple importance sampling for bidirectional rendering algorithms. ACM Trans. Graph. 41(4): 80:1-80:12 (2022) - [j6]Alexander Rath, Pascal Grittmann, Sebastian Herholz, Philippe Weier, Philipp Slusallek:
EARS: efficiency-aware russian roulette and splitting. ACM Trans. Graph. 41(4): 81:1-81:14 (2022) - [d2]Pascal Grittmann, Ömercan Yazici, Iliyan Georgiev, Philipp Slusallek:
Implementation of Efficiency-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. Zenodo, 2022
- [d1]Alexander Rath, Pascal Grittmann, Sebastian Herholz, Philippe Weier, Philipp Slusallek:
Implementation of EARS: Efficiency-Aware Russian Roulette and Splitting. Zenodo, 2022 - 2021
- [j5]Pascal Grittmann, Iliyan Georgiev, Philipp Slusallek:
Correlation-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. Comput. Graph. Forum 40(2): 231-238 (2021) - 2020
- [j4]Alexander Rath, Pascal Grittmann, Sebastian Herholz, Petr Vévoda, Philipp Slusallek, Jaroslav Krivánek:
Variance-aware path guiding. ACM Trans. Graph. 39(4): 151 (2020) - [c1]Alexander Keller, Pascal Grittmann, Jirí Vorba, Iliyan Georgiev, Martin Sik, Eugene d'Eon, Pascal Gautron, Petr Vévoda, Ivo Kondapaneni:
Advances in Monte Carlo rendering: the legacy of Jaroslav Křivánek. SIGGRAPH Courses 2020: 3:1-3:366
2010 – 2019
- 2019
- [j3]Ivo Kondapaneni, Petr Vévoda, Pascal Grittmann, Tomás Skrivan, Philipp Slusallek, Jaroslav Krivánek:
Optimal multiple importance sampling. ACM Trans. Graph. 38(4): 37:1-37:14 (2019) - [j2]Pascal Grittmann, Iliyan Georgiev, Philipp Slusallek, Jaroslav Krivánek:
Variance-aware multiple importance sampling. ACM Trans. Graph. 38(6): 152:1-152:9 (2019) - 2018
- [j1]Pascal Grittmann, Arsène Pérard-Gayot, Philipp Slusallek, Jaroslav Krivánek:
Efficient Caustic Rendering with Lightweight Photon Mapping. Comput. Graph. Forum 37(4): 133-142 (2018)
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-10-13 18:00 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:
