20.500.12556/DKUM-19923 VSEBNOSTNI TEST V PROSTORU Z ALGORITMOM POLTRAKA CONTAINMENT TEST IN 3D SPACE WITH THE RAY ALGORITHM V diplomskem delu rešujemo problem vsebnosti v prostoru s pomočjo poltraka. Problem rešujemo brez predhodne priprave podatkov in s pripravo podatkov. Osredotočimo se predvsem na metodo s pripravo podatkov, ki za delitev prostora uporablja drevesa kd. Opišemo tudi problem geometrijske robustnosti in zanj podamo možne rešitve. Vse metode testiramo na različnih modelih in jih med seboj primerjamo. In this thesis we are solving the inclusion test in three-dimensional space with the help of rays. The problem is solved with and without data preparation. Our main focus was the data preparation method, which uses the kd-tree structure for spatial subdivision. We also describe the geometry robustness problem and the solutions for solving it. All methods are tested on various models and compared with each other. 3D vsebnostni test računalniška geometrija drevesa kd delitev prostora algoritem 3D inclusion test computational geometry kd-trees spatial subdivision algorithm true true false [D. Horvat] Slovenski jezik Angleški jezik Diplomsko delo/naloga 2011-09-02 17:56:35 2011-09-06 12:07:35 2022-04-13 15:45:34 2023-12-26 03:21:39 2011 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.92(043.2) 15300630 URN:SI:UM:DK:HUGLPWCL UNI_Horvat_Denis_2011.pdf UNI_Horvat_Denis_2011.pdf 1 86AE894642A4DA389F4AAC8D86BAFAF2 2772e3c51d5c435165261e33cdfe0d9c6732ed592ab7758cc9e3a00c8b17cdc5 7c4410c9-7c05-11eb-bb7a-00155d0001ca 20.500.12556/dkum/698cfcea-de24-4572-a774-b923386bee75 https://dk.um.si/Dokument.php?lang=slv&id=24381 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0