This work contains a few basic terms of analytical geometry. We mention some of ray-triangle intersection computation algorithms and present some use-case examples. We discuss capabilities of CUDA, optimization techniques of this architecture and implementation with focus on given issues. Algorithms of ray-triangle intersection are tested and results are discussed.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:236360 |
| Date | January 2013 |
| Creators | Horák, František |
| Contributors | Navrátil, Jan, Havel, Jiří |
| Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0018 seconds