[277] | 1 | @Article{wimmer05:gpugems, |
---|
| 2 | author = {Michael Wimmer and Ji\v{r}\'\i{} Bittner}, |
---|
| 3 | title = {Hardware Occlusion Queries Made Useful}, |
---|
| 4 | journal = {GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation}, |
---|
| 5 | year = {2005}, |
---|
| 6 | pages = {91--108}, |
---|
| 7 | publisher = {Addison Wesley} |
---|
| 8 | } |
---|
| 9 | |
---|
[243] | 10 | @Article{bittner03:jep, |
---|
| 11 | author = {Ji\v{r}\'\i{} Bittner and Peter Wonka}, |
---|
| 12 | title = {Visibility in Computer Graphics}, |
---|
| 13 | journal = {Environment and Planning B: Planning and Design}, |
---|
| 14 | year = {2003}, |
---|
| 15 | volume = {30}, |
---|
| 16 | number = {5}, |
---|
| 17 | pages = {729--756}, |
---|
| 18 | month = sep, |
---|
| 19 | publisher = {Pion Ltd} |
---|
| 20 | } |
---|
| 21 | |
---|
| 22 | |
---|
[277] | 23 | @PhdThesis{bittner:02:phd, |
---|
[243] | 24 | author = {Ji\v{r}\'\i{} Bittner}, |
---|
| 25 | title = {Hierarchical Techniques for Visibility Computations}, |
---|
| 26 | school = {Czech Technical University in Prague}, |
---|
| 27 | year = {2002}, |
---|
| 28 | month = oct, |
---|
| 29 | } |
---|
| 30 | |
---|
| 31 | @Article{bittner:02:cg, |
---|
| 32 | author = {Ji\v{r}\'\i{} Bittner and jan P\v{r}ikryl and Pavel Slav\'\i{k}}, |
---|
| 33 | title = {Exact Regional Visibility using Line Space Partitioning}, |
---|
| 34 | journal = {Computers \& Graphics}, |
---|
| 35 | year = {2003}, |
---|
| 36 | volume = {27}, |
---|
| 37 | number = {4}, |
---|
| 38 | pages = {569--580}, |
---|
| 39 | month = aug, |
---|
| 40 | } |
---|
| 41 | |
---|
| 42 | |
---|
| 43 | @article{bittner01:jvca, |
---|
| 44 | author = "Ji\v{r}\'\i{} Bittner and Vlastimil Havran", |
---|
| 45 | title = "Exploiting Coherence in Hierarchical Visibility Algorithms", |
---|
| 46 | journal = "Journal of Visualization and Computer Animation, John Wiley \& Sons", |
---|
| 47 | year = "2001", |
---|
| 48 | volume = "12", |
---|
| 49 | pages = "277--286" |
---|
| 50 | } |
---|
| 51 | |
---|
| 52 | @inproceedings{bittner:2002:SCCG, |
---|
| 53 | author = "Ji\v{r}\'\i{} Bittner", |
---|
| 54 | title = "Efficient Construction of Visibility Maps using Approximate Occlusion Sweep", |
---|
| 55 | booktitle = "Proceedings of Spring Conference on Computer Graphics (SCCG'02)", |
---|
| 56 | address = {Budmerice, Slovakia}, |
---|
| 57 | year = "2002", |
---|
| 58 | pages = "163--171" |
---|
| 59 | } |
---|
| 60 | |
---|
| 61 | |
---|
| 62 | |
---|
| 63 | @inproceedings{havran:2002:WSCG, |
---|
| 64 | author = "Vlastimil Havran and Ji\v{r}\'\i{} Bittner", |
---|
| 65 | title = "On Improving {Kd}-Trees for Ray Shooting", |
---|
| 66 | booktitle = "Journal of WSCG (Proceedings of Winter School on Computer Graphics 2001)", |
---|
| 67 | address = {Plzen, Czech Republic}, |
---|
| 68 | year = "2002", |
---|
| 69 | month = feb, |
---|
| 70 | volume = "10", |
---|
| 71 | number = "1--3", |
---|
| 72 | abstract="Efficient ray shooting algorithm is inherently required by |
---|
| 73 | many computer graphics algorithms, particularly in image |
---|
| 74 | synthesis. Practical ray shooting algorithms aiming at the |
---|
| 75 | average-case complexity use some underlying spatial data structure |
---|
| 76 | such as $kd$-tree. We show the new termination criteria algorithm that |
---|
| 77 | improves the space and time complexity of the $kd$-tree |
---|
| 78 | construction. It provides efficient ray-shooting queries and does not |
---|
| 79 | require any specific constants from a user. Further, we show how to |
---|
| 80 | apply a novel clipping algorithm into the $kd$-tree within |
---|
| 81 | construction phase in order to improve its properties." |
---|
| 82 | } |
---|
| 83 | |
---|
| 84 | |
---|
| 85 | @inproceedings{bittner:2001:PG, |
---|
| 86 | author = "Ji\v{r}\'\i{} Bittner and Peter Wonka and Michael Wimmer", |
---|
| 87 | title = "Visibility Preprocessing for Urban Scenes using Line Space Subdivision", |
---|
| 88 | booktitle = "Proceedings of Pacific Graphics (PG'01)", |
---|
| 89 | address = {Tokyo, Japan}, |
---|
| 90 | year = "2001", |
---|
| 91 | publisher = "IEEE Computer Society", |
---|
| 92 | pages = "276--284" |
---|
| 93 | } |
---|
| 94 | |
---|
| 95 | @inproceedings{bittner:2001:SCCG, |
---|
| 96 | |
---|
| 97 | author = "Ji\v{r}\'\i{} Bittner and Vlastimil Havran", |
---|
| 98 | title = "Exploiting Temporal and Spatial Coherence in Hierarchical Visibility Algorithms", |
---|
| 99 | booktitle = "Proceedings of Spring Conference on Computer Graphics (SCCG'01)", |
---|
| 100 | address = {Budmerice, Slovakia}, |
---|
| 101 | year = "2001", |
---|
| 102 | publisher = "IEEE Computer Society", |
---|
| 103 | pages = "213--220" |
---|
| 104 | } |
---|
| 105 | |
---|
| 106 | @TechReport{Bittner:2001:ERV_long, |
---|
| 107 | |
---|
| 108 | author = "Ji\v{r}\'\i{} Bittner and Jan P\v{r}ikryl", |
---|
| 109 | title = "Exact Regional Visibility using Line Space Partitioning", |
---|
| 110 | year = "2001", |
---|
| 111 | month = march, |
---|
| 112 | pages = "1--13", |
---|
| 113 | keywords = "visibility, line--space, BSP--tree, kD--tree, Plucker coordinates, projective geometry", |
---|
| 114 | number = "TR-186-2-01-06", |
---|
| 115 | institution = "Institute of Computer Graphics and Algorithms, |
---|
| 116 | Vienna University of Technology", |
---|
| 117 | address = "Karlsplatz 13/186/2, A-1040 Vienna, Austria", |
---|
| 118 | ftp = "ftp://ftp.cg.tuwien.ac.at/pub/TR/01/TR-186-2-01-06Paper.ps.gz", |
---|
| 119 | note = "human contact: technical-report@cg.tuwien.ac.at", |
---|
| 120 | abstract = " We present a new technique for exact and output sensitive |
---|
| 121 | determination of visibility from a polygonal region |
---|
| 122 | in the pla ne. It uses hierarchical partitioning of |
---|
| 123 | {\em line space}, that provid es comprehensive |
---|
| 124 | description of visibility for a set of {\em occlu |
---|
| 125 | ders}. To the best of our knowledge, it is the first |
---|
| 126 | exact regional visibility algorithm suitable for |
---|
| 127 | visibility preprocessing of large scenes of |
---|
| 128 | unspecific type. We have evaluated the implementation |
---|
| 129 | on scenes with various visibility characteristics." |
---|
| 130 | } |
---|
| 131 | |
---|
| 132 | @TechReport{Bittner:2001:ERV, |
---|
| 133 | |
---|
| 134 | author = "Ji\v{r}\'\i{} Bittner and Jan P\v{r}ikryl", |
---|
| 135 | title = "Exact Regional Visibility using Line Space Partitioning", |
---|
| 136 | year = "2001", |
---|
| 137 | month = march, |
---|
| 138 | pages = "1--13", |
---|
| 139 | keywords = "visibility, line--space, BSP--tree, kD--tree, Plucker coordinates, projective geometry", |
---|
| 140 | number = "TR-186-2-01-06", |
---|
| 141 | institution = "Institute of Computer Graphics and Algorithms, |
---|
| 142 | Vienna University of Technology", |
---|
| 143 | ftp = "ftp://ftp.cg.tuwien.ac.at/pub/TR/01/TR-186-2-01-06Paper.ps.gz", |
---|
| 144 | note = "Available as ftp://ftp.cg.tuwien.ac.at/pub/TR/01/TR-186-2-01-06Paper.ps.gz", |
---|
| 145 | abstract = " We present a new technique for exact and output sensitive |
---|
| 146 | determination of visibility from a polygonal region |
---|
| 147 | in the pla ne. It uses hierarchical partitioning of |
---|
| 148 | {\em line space}, that provid es comprehensive |
---|
| 149 | description of visibility for a set of {\em occlu |
---|
| 150 | ders}. To the best of our knowledge, it is the first |
---|
| 151 | exact regional visibility algorithm suitable for |
---|
| 152 | visibility preprocessing of large scenes of |
---|
| 153 | unspecific type. We have evaluated the implementation |
---|
| 154 | on scenes with various visibility characteristics." |
---|
| 155 | } |
---|
| 156 | |
---|
| 157 | ##################### |
---|
| 158 | |
---|
| 159 | @inproceedings{havran:2001:EG, |
---|
| 160 | |
---|
| 161 | author = "Vlastimil Havran and Ji\v{r}\'\i{} Bittner", |
---|
| 162 | title = "LCTS: Ray Shooting using Longest Common Traversal Sequences", |
---|
| 163 | booktitle = "Proceedings of Eurographics (EG'00)", |
---|
| 164 | address = {Interlaken, Switzerland}, |
---|
| 165 | year = "2000", |
---|
| 166 | pages = "59--70" |
---|
| 167 | } |
---|
| 168 | |
---|
| 169 | %%%%%%%%% 1999 %%%%%%%%%%%%%%%% |
---|
| 170 | |
---|
| 171 | |
---|
| 172 | |
---|
| 173 | @TechReport{bittner99min, |
---|
| 174 | author = {Jiri Bittner}, |
---|
| 175 | title = {Hierarchical Techniques for Visibility Determination}, |
---|
| 176 | institution = {Department of Computer Science and Engineering, |
---|
| 177 | Czech Technical University in Prague}, |
---|
| 178 | year = {1999}, |
---|
| 179 | number = {DS-005}, |
---|
| 180 | month = {March}, |
---|
| 181 | note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/publications/minimum.ps.gz" |
---|
| 182 | } |
---|
| 183 | |
---|
| 184 | |
---|
| 185 | @Misc{bittner99eg, |
---|
| 186 | author = {Ji\v{r}\'\i{} Bittner and Vlastimil Havran}, |
---|
| 187 | title = {Exploiting Temporal and Spatial Coherence in Hierarchical Visibility |
---|
| 188 | Algorithms}, |
---|
| 189 | howpublished = {Submitted to the Eurographics'99 conference in Milano}, |
---|
| 190 | month = {January}, |
---|
| 191 | year = {1999}, |
---|
| 192 | } |
---|
| 193 | |
---|
| 194 | @Misc{havran99wscg, |
---|
| 195 | author = {Vlastimil Havran and Ji\v{r}\'\i{} Bittner and |
---|
| 196 | Ji\v{r}\'\i{} \v{Z}\'{a}ra}, |
---|
| 197 | title = {Constructing Rectilinear BSP Trees for Preffered Ray Sets}, |
---|
| 198 | howpublished = {Poster presentation at the WSCG'99 conference, Pilsen}, |
---|
| 199 | month = {February}, |
---|
| 200 | year = {1999}, |
---|
| 201 | } |
---|
| 202 | |
---|
| 203 | @InProceedings{havran99sccg, |
---|
| 204 | author = { Vlastimil Havran and Ji\v{r}\'\i{} Bittner}, |
---|
| 205 | title = { Rectilinear BSP trees for preferred ray sets }, |
---|
| 206 | booktitle = { Proceedings of the Spring Conference on Computer Graphics (SCCG'99)}, |
---|
| 207 | address = { Budmerice, Slovakia}, |
---|
| 208 | year = 1999, |
---|
| 209 | pages = "171--178" |
---|
| 210 | } |
---|
| 211 | % note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/sccg98.ps.gz", |
---|
| 212 | |
---|
| 213 | |
---|
| 214 | @Misc{bittner99wshop, |
---|
| 215 | author = {Ji\v{r}\'\i{} Bittner and Vlastimil Havran Tom\'a\v{s}{} Kopal}, |
---|
| 216 | title = {Visibility Computations in Large 3D Scenes}, |
---|
| 217 | howpublished = {Poster presentation at the Workshop'99, CTU Prague}, |
---|
| 218 | month = {January}, |
---|
| 219 | year = {1999}, |
---|
| 220 | } |
---|
| 221 | |
---|
| 222 | %%%%%%%%% 1998 %%%%%%%%%%%%%%%%%%%%%% |
---|
| 223 | |
---|
| 224 | @Article{Havran98:d, |
---|
| 225 | author = {Havran, V. and Kopal, T. and Bittner, J. and \v{Z}\'{a}ra, J.}, |
---|
| 226 | title = {FAST ROBUST BSP TREE TRAVERSAL ALGORITHM FOR RAY TRACING}, |
---|
| 227 | journal = {Journal of Graphics Tools}, |
---|
| 228 | year = { 1998 }, |
---|
| 229 | month = dec, |
---|
| 230 | } |
---|
| 231 | |
---|
| 232 | @inproceedings{bittner98b, |
---|
| 233 | author = "Ji\v{r}\'\i{} Bittner and Vlastimil Havran and Pavel Slav\'\i{k}", |
---|
| 234 | title = "Hierarchical Visibility Culling with Occlusion Trees", |
---|
| 235 | booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)", |
---|
| 236 | year = "1998", |
---|
| 237 | pages = "207--219", |
---|
| 238 | publisher = "IEEE", |
---|
| 239 | who = "Havran Vlastimil: VIS-0047", |
---|
| 240 | } |
---|
| 241 | % note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/paper-copy.ps.gz", |
---|
| 242 | |
---|
| 243 | @InProceedings{Havran98:b, |
---|
| 244 | author = { Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.}, |
---|
| 245 | title = { Ray Tracing with Rope Trees}, |
---|
| 246 | booktitle = { Proceedings of 13th Spring Conference on Computer Graphics}, |
---|
| 247 | address = { Budmerice}, |
---|
| 248 | date = {April 23--26}, |
---|
| 249 | year = 1998, |
---|
| 250 | pages = "130--139", |
---|
| 251 | note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/sccg98.ps.gz", |
---|
| 252 | } |
---|
| 253 | |
---|
| 254 | |
---|
| 255 | @InProceedings{bittner98poster, |
---|
| 256 | author = {Bittner, J.}, |
---|
| 257 | title = {Conservative Hierarchical Visibility with Occlusion Trees}, |
---|
| 258 | booktitle = {Proceedings of Poster'98}, |
---|
| 259 | organization = { CTU--FEE }, |
---|
| 260 | address = {Prague, Czech Republic}, |
---|
| 261 | pages = {2 pages, IC 03}, |
---|
| 262 | month = {May}, |
---|
| 263 | year = {1998}, |
---|
| 264 | } |
---|
| 265 | |
---|
| 266 | |
---|
| 267 | @InProceedings{Kopal98:b, |
---|
| 268 | author = {Kopal, T. and Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.}, |
---|
| 269 | title = {Directionality in Ray Tracing}, |
---|
| 270 | booktitle = {Proceedings of Poster'98}, |
---|
| 271 | note = {2nd International Student Conference on Electrical Engineering}, |
---|
| 272 | organization = { CTU--FEE }, |
---|
| 273 | address = {Prague, Czech Republic}, |
---|
| 274 | pages = {2 pages, IC 24}, |
---|
| 275 | month = {May}, |
---|
| 276 | year = {1998}, |
---|
| 277 | } |
---|
| 278 | |
---|
| 279 | |
---|
| 280 | @InProceedings{bittner98wshop, |
---|
| 281 | author = {Bittner, J.}, |
---|
| 282 | title = {Hierarchical Visibility Algorithms}, |
---|
| 283 | booktitle = {Proceedings of Workshop'98}, |
---|
| 284 | organization = { CTU--FEE }, |
---|
| 285 | address = { Prague, Czech Republic }, |
---|
| 286 | editor= { A. Strejc }, |
---|
| 287 | month = { February}, |
---|
| 288 | pages = { 195--196}, |
---|
| 289 | year = { 1998 }, |
---|
| 290 | } |
---|
| 291 | |
---|
| 292 | |
---|
| 293 | %%%%%%%%% 1997 %%%%%%%%%%%%%%%%%%%%%%% |
---|
| 294 | |
---|
| 295 | @MastersThesis{Bittner:masters97, |
---|
| 296 | author = {Bittner, J.}, |
---|
| 297 | title = {Global Visibility Computations}, |
---|
| 298 | school = {Department of Computer Science and Engineering, Czech Technical University |
---|
| 299 | Prague}, |
---|
| 300 | year = {1997}, |
---|
| 301 | month = {January}, |
---|
| 302 | note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/masters.ps.gz", |
---|
| 303 | } |
---|
| 304 | |
---|
| 305 | @InProceedings{Bittner:gaw97, |
---|
| 306 | author = {Bittner, J.}, |
---|
| 307 | title = {Global Visibility Computations}, |
---|
| 308 | booktitle = {Graphics and WEB '97}, |
---|
| 309 | year = {1997}, |
---|
| 310 | organization = {HTW Dresden, Germany}, |
---|
| 311 | key = {global visibility, VRML, conservative visibility, spatial |
---|
| 312 | subdivision, visibility computations}, |
---|
| 313 | } |
---|
| 314 | |
---|
| 315 | @InProceedings{Bittner:cescg97, |
---|
| 316 | author = {Bittner, J.}, |
---|
| 317 | title = {Global Visibility}, |
---|
| 318 | booktitle = {Proceedings of the CESCG '97, April 97, Bratislava and Vienna}, |
---|
| 319 | year = {1997}, |
---|
| 320 | pages = {105--111}, |
---|
| 321 | key = {global visibility, VRML, conservative visibility, spatial |
---|
| 322 | subdivision, visibility computations}, |
---|
| 323 | } |
---|
| 324 | |
---|
| 325 | @InProceedings{Trefny97, |
---|
| 326 | author = {M. Trefn\'{y} and J. Bittner}, |
---|
| 327 | title = {Global Visibility}, |
---|
| 328 | booktitle = {Proceedings of The Fifth Internatinal Conference in Central |
---|
| 329 | Europe on Computer Graphics and Visualization '97}, |
---|
| 330 | key = {global visibility, VRML, conservative visibility, spatial |
---|
| 331 | subdivision, visibility computations}, |
---|
| 332 | volume = {IV}, |
---|
| 333 | pages = {691--694}, |
---|
| 334 | year = {1997}, |
---|
| 335 | month = feb |
---|
| 336 | } |
---|
| 337 | |
---|
| 338 | %%%%%%%%%%%% 1996 %%%%%%%%%%%%%%%%%%% |
---|
| 339 | @TechReport{Bittner:delft96, |
---|
| 340 | author = {Bittner, J.}, |
---|
| 341 | title = {RECNET - The speech recognition system}, |
---|
| 342 | institution = {Technical University, Delft}, |
---|
| 343 | year = {1996}, |
---|
| 344 | number = {TR 96--160}, |
---|
| 345 | month = {June} |
---|
| 346 | } |
---|
| 347 | |
---|
| 348 | |
---|
| 349 | |
---|
| 350 | |
---|
| 351 | |
---|
| 352 | |
---|
| 353 | |
---|
| 354 | |
---|