default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Bittner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Martin Kácerik
, Jirí Bittner:
SAH-Optimized k-DOP Hierarchies for Ray Tracing. Proc. ACM Comput. Graph. Interact. Tech. 7(3): 32:1-32:16 (2024)- 2023
- [j30]Jaroslav Kravec, Martin Kácerik, Jirí Bittner:
PVLI: potentially visible layered image for real-time ray tracing. Vis. Comput. 39(8): 3359-3372 (2023) - 2021
- [j29]Daniel Meister, Adam Pospísil, Imari Sato, Jirí Bittner:
Spatio-temporal BRDF: Modeling and synthesis. Comput. Graph. 97: 279-291 (2021) - [j28]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) - [j27]Alejandro Graciano, Antonio J. Rueda Ruiz, Adam Pospísil, Jirí Bittner, Bedrich Benes:
QuadStack: An Efficient Representation and Direct Rendering of Layered Datasets. IEEE Trans. Vis. Comput. Graph. 27(9): 3733-3744 (2021) - 2020
- [c27]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
- [j26]J. Hendrich, Adam Pospísil, Daniel Meister, Jirí Bittner:
Ray Classification for Accelerated BVH Traversal. Comput. Graph. Forum 38(4): 49-56 (2019) - [j25]Ladislav Cmolík, Jirí Bittner:
Real-Time External Labeling of Ghosted Views. IEEE Trans. Vis. Comput. Graph. 25(7): 2458-2470 (2019) - 2018
- [j24]Daniel Meister, Jirí Bittner:
Parallel Reinsertion for Bounding Volume Hierarchy Optimization. Comput. Graph. Forum 37(2): 463-473 (2018) - [j23]Daniel Meister, Jirí Bittner:
Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction. IEEE Trans. Vis. Comput. Graph. 24(3): 1345-1353 (2018) - 2017
- [j22]Ivan Viola, Jirí Bittner:
Foreword to the Special Section on SCCG 2017. Comput. Graph. 67: A1 (2017) - [j21]J. Hendrich, Daniel Meister, Jirí Bittner:
Parallel BVH Construction using Progressive Hierarchical Refinement. Comput. Graph. Forum 36(2): 487-494 (2017) - [j20]Vlastimil Havran, Jan Hosek, Sárka Nemcová, Jirí Cáp, Jirí Bittner:
Lightdrum - Portable Light Stage for Accurate BTF Measurement on Site. Sensors 17(3): 423 (2017) - [c26]Marek Vinkler, Jirí Bittner, Vlastimil Havran:
Extended Morton codes for high performance bounding volume hierarchy construction. High Performance Graphics 2017: 9:1-9:8 - [c25]Jakub Boksanský, Adam Pospísil, Jirí Bittner:
VAO++: Practical Volumetric Ambient Occlusion for Games. EGSR (EI&I) 2017: 31-39 - [c24]Vlastimil Havran, Jan Hosek, Sárka Nemcová, Jirí Cáp, Jirí Bittner:
Lightdrum: surface reflectance measurement on site. SIGGRAPH Posters 2017: 80:1-80:2 - [e2]Pavel Zemcík, Stephen N. Spencer, Jirí Bittner, Ivan Viola:
Proceedings of the 33rd Spring Conference on Computer Graphics, SCCG 2017, Mikulov, Czech Republic, May 15-17, 2017. ACM 2017, ISBN 978-1-4503-5107-2 [contents] - 2016
- [j19]Marek Vinkler, Vlastimil Havran, Jirí Bittner:
Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing. Comput. Graph. Forum 35(8): 68-79 (2016) - [j18]Marek Vinkler, Vlastimil Havran, Jirí Bittner, Jirí Sochor:
Parallel On-Demand Hierarchy Construction on Contemporary GPUs. IEEE Trans. Vis. Comput. Graph. 22(7): 1886-1898 (2016) - [j17]Daniel Meister, Jirí Bittner:
Parallel BVH construction using k-means clustering. Vis. Comput. 32(6-8): 977-987 (2016) - 2015
- [j16]Jirí Bittner, Michal Hapala, Vlastimil Havran:
Incremental BVH construction for ray tracing. Comput. Graph. 47: 135-144 (2015) - [j15]Jirí Bittner, Daniel Meister:
T-SAH: Animation Optimized Bounding Volume Hierarchies. Comput. Graph. Forum 34(2): 527-536 (2015) - [j14]Oliver Mattausch, Jirí Bittner, Alberto Jaspe, Enrico Gobbetti, Michael Wimmer, Renato Pajarola:
CHC+RT: Coherent Hierarchical Culling for Ray Tracing. Comput. Graph. Forum 34(2): 537-548 (2015) - 2014
- [c23]Vlastimil Havran, Jirí Bittner:
Efficient Sorting and Searching in Rendering Algorithms. Eurographics (Tutorials) 2014: 8 - [c22]Marek Vinkler, Vlastimil Havran, Jirí Bittner:
Bounding volume hierarchies versus kd-trees on contemporary many-core architectures. SCCG 2014: 29-36 - 2013
- [j13]Jirí Bittner, Michal Hapala, Vlastimil Havran:
Fast Insertion-Based Optimization of Bounding Volume Hierarchies. Comput. Graph. Forum 32(1): 85-100 (2013) - [j12]Tomás Barák, Jirí Bittner, Vlastimil Havran:
Temporally Coherent Adaptive Sampling for Imperfect Shadow Maps. Comput. Graph. Forum 32(4): 87-96 (2013) - [j11]Marek Vinkler, Jirí Bittner, Vlastimil Havran, Michal Hapala:
Massively Parallel Hierarchical Scene Processing with Applications in Rendering. Comput. Graph. Forum 32(8): 13-25 (2013) - [j10]Tomás Nikodým, Vlastimil Havran, Jirí Bittner:
Multiple Live Video Environment Map Sampling. J. WSCG 21(2): 127-136 (2013) - [c21]Jirí Bittner, Jirí Zára:
DCGI Laboratories at CTU Prague, Czech Republic. Eurographics (Lab Presentations) 2013 - 2012
- [c20]Ivo Malý, Jirí Bittner, Pavel Slavík:
Using Annotated Task Models for Accessibility Evaluation. ICCHP (1) 2012: 315-322 - 2011
- [c19]Jirí Bittner, Oliver Mattausch, Ari Silvennoinen, Michael Wimmer:
Shadow caster culling for efficient shadow mapping. SI3D 2011: 81-88 - 2010
- [j9]Ladislav Cmolík, Jirí Bittner:
Layout-aware optimization for interactive labeling of 3D models. Comput. Graph. 34(4): 378-387 (2010)
2000 – 2009
- 2009
- [j8]Jirí Bittner, Oliver Mattausch, Peter Wonka, Vlastimil Havran, Michael Wimmer:
Adaptive global visibility sampling. ACM Trans. Graph. 28(3): 94 (2009) - [c18]Jirí Bittner, Vlastimil Havran:
RDH: ray distribution heuristics for construction of spatial data structures. SCCG 2009: 51-58 - 2008
- [j7]Oliver Mattausch, Jirí Bittner, Michael Wimmer:
CHC++: Coherent Hierarchical Culling Revisited. Comput. Graph. Forum 27(2): 221-230 (2008) - [j6]Kaichi Zhou, Eugene Zhang, Jirí Bittner, Peter Wonka:
Visibility-driven Mesh Analysis and Visualization through Graph Cuts. IEEE Trans. Vis. Comput. Graph. 14(6): 1667-1674 (2008) - [c17]Miguel Lastra, Carlos Ureña, Jirí Bittner, Rubén Jesús García, Rosana Montes:
Estimación de Densidades usando GPUs. CEIG 2008: 37-46 - 2007
- [c16]Oliver Mattausch, Jirí Bittner, Peter Wonka, Michael Wimmer:
Optimized subdivisions for preprocessed visibility. Graphics Interface 2007: 335-342 - [c15]Jean Pierre Charalambos, Jirí Bittner, Michael Wimmer, Eduardo Romero:
Optimized HLOD Refinement Driven by Hardware Occlusion Queries. ISVC (1) 2007: 106-117 - [c14]Vlastimil Havran, Jirí Bittner:
Ray tracing with sparse boxes. SCCG 2007: 49-54 - [e1]Dieter Schmalstieg, Jirí Bittner:
28th Annual Conference of the European Association for Computer Graphics, Eurographics 2007 - State of the Art Reports, Prague, Czech Republic, September 3-7, 2007. Eurographics Association 2007 [contents] - 2006
- [c13]Vlastimil Havran, Jirí Bittner:
Efficient Sorting and Searching in Rendering Algorithms. Eurographics (Tutorials) 2006: 325-398 - [c12]Oliver Mattausch, Jirí Bittner, Michael Wimmer:
Adaptive Visibility-Driven View Cell Construction. Rendering Techniques 2006: 195-205 - 2005
- [c11]Vlastimil Havran, Jirí Bittner, Robert Herzog, Hans-Peter Seidel:
Ray Maps for Global Illumination. Rendering Techniques 2005: 43-54 - [c10]Jirí Bittner, Peter Wonka, Michael Wimmer:
Fast Exact From-Region Visibility in Urban Scenes. Rendering Techniques 2005: 223-230 - 2004
- [j5]Jirí Bittner, Michael Wimmer, Harald Piringer, Werner Purgathofer:
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful. Comput. Graph. Forum 23(3): 615-624 (2004) - [c9]Vlastimil Havran, Jirí Bittner, Hans-Peter Seidel:
Ray maps for global illumination. SIGGRAPH Sketches 2004: 77 - 2003
- [j4]Jirí Bittner, Jan Prikryl, Pavel Slavík:
Exact regional visibility using line space partitioning. Comput. Graph. 27(4): 569-580 (2003) - [c8]Alessandro Artusi, Jirí Bittner, Michael Wimmer, Alexander Wilkie:
Delivering Interactivity to Complex Tone Mapping Operators. Rendering Techniques 2003: 38-44 - [c7]Vlastimil Havran, Jirí Bittner, Hans-Peter Seidel:
Exploiting temporal coherence in ray casted walkthroughs. SCCG 2003: 149-155 - 2002
- [c6]Jirí Bittner:
Efficient construction of visibility maps using approximate occlusion sweep. SCCG 2002: 167-175 - [c5]Vlastimil Havran, Jirí Bittner:
On Improving Kd Tree for Ray Shooting. WSCG 2002: 209-216 - 2001
- [j3]Jirí Bittner, Vlastimil Havran:
Exploiting coherence in hierarchical visibility algorithms. Comput. Animat. Virtual Worlds 12(5): 277-286 (2001) - [c4]Jirí Bittner, Peter Wonka, Michael Wimmer:
Visibility Preprocessing for Urban Scenes using Line Space Subdivision. PG 2001: 276-284 - [c3]Jirí Bittner, Vlastimil Havran:
Exploiting Temporal and Spatial Coherence in Hierarchical Visibility Algorithms. SCCG 2001: 156-164 - 2000
- [j2]Vlastimil Havran, Jirí Bittner:
LCTS: Ray Shooting using Longest Common Traversal Sequences. Comput. Graph. Forum 19(3): 59-70 (2000)
1990 – 1999
- 1999
- [c2]Yiorgos L. Chrysanthou, Daniel Cohen-Or, Gadi Fibich, Dan Halperin, Eyal Zadicario, Shuly Lev-Yehudi, Dirk Bartz, Michael Meißner, Tobias Hüttner, Jirí Bittner, Vlastimil Havran, Pavel Slavík, James T. Klosowski, Cláudio T. Silva:
Tutorial 9 - Visibility. Eurographics (Tutorials) 1999 - 1998
- [c1]Jirí Bittner, Vlastimil Havran, Pavel Slavík:
Hierarchical Visibility Culling with Occlusion Trees. Computer Graphics International 1998: 207-219 - 1997
- [j1]Vlastimil Havran, Tomás Kopal, Jirí Bittner, Jirí Zára:
Fast Robust BSP Tree Traversal Algorithm for Ray Tracing. J. Graphics, GPU, & Game Tools 2(4): 15-23 (1997)
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-23 21:29 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:
