default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Meister 0002
Person information
- affiliation: Czech Technical University in Prague
Other persons with the same name
- Daniel Meister 0001 — RWTH Aachen, Germany (and 2 more)
- Daniel Meister 0003 — Fraunhofer Institute for Integrated Circuits IIS, Erlangen, Germany
- Daniel Meister 0004 — Advanced Micro Devices, Inc., Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Carsten Benthin
, Daniel Meister, Joshua Barczak, Rohan Mehalwal, John A. Tsakok, Andrew Kensler:
H-PLOC: Hierarchical Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction. Proc. ACM Comput. Graph. Interact. Tech. 7(3): 30:1-30:14 (2024)- [j10]Daniel Meister, Paritosh Kulkarni, Aaryaman Vasishta, Takahiro Harada:
HIPRT: A Ray Tracing Framework in HIP. Proc. ACM Comput. Graph. Interact. Tech. 7(3): 44:1-44:18 (2024) - 2021
- [j9]Daniel Meister, Adam Pospísil, Imari Sato, Jirí Bittner:
Spatio-temporal BRDF: Modeling and synthesis. Comput. Graph. 97: 279-291 (2021) - [j8]Daniel Meister, Shinji Ogaki, Carsten Benthin, Michael J. Doyle, Michael Guthe, Jirí Bittner:
A Survey on Bounding Volume Hierarchies for Ray Tracing. Comput. Graph. Forum 40(2): 683-712 (2021) - [j7]Sabyasachi Mukherjee, Sayan Mukherjee, Binh-Son Hua, Nobuyuki Umetani, Daniel Meister:
Neural Sequence Transformation. Comput. Graph. Forum 40(7): 131-140 (2021) - 2020
- [c1]Daniel Meister, Jakub Boksanský, Michael Guthe, Jirí Bittner:
On Ray Reordering Techniques for Faster GPU Ray Tracing. I3D 2020: 13:1-13:9
2010 – 2019
- 2019
- [j6]J. Hendrich, Adam Pospísil, Daniel Meister, Jirí Bittner:
Ray Classification for Accelerated BVH Traversal. Comput. Graph. Forum 38(4): 49-56 (2019) - 2018
- [j5]Daniel Meister, Jirí Bittner:
Parallel Reinsertion for Bounding Volume Hierarchy Optimization. Comput. Graph. Forum 37(2): 463-473 (2018) - [j4]Daniel Meister, Jirí Bittner:
Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction. IEEE Trans. Vis. Comput. Graph. 24(3): 1345-1353 (2018) - 2017
- [j3]J. Hendrich, Daniel Meister, Jirí Bittner:
Parallel BVH Construction using Progressive Hierarchical Refinement. Comput. Graph. Forum 36(2): 487-494 (2017) - 2016
- [j2]Daniel Meister, Jirí Bittner:
Parallel BVH construction using k-means clustering. Vis. Comput. 32(6-8): 977-987 (2016) - 2015
- [j1]Jirí Bittner, Daniel Meister:
T-SAH: Animation Optimized Bounding Volume Hierarchies. Comput. Graph. Forum 34(2): 527-536 (2015)
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 2025-01-20 22:55 CET 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:
