diplomsko delo

Abstract

V diplomskem delu smo implementirali razne algoritme za zaznavanjetrkov v igrah. Te smo preizkusili in izmerili kako hitro se izvajajo pod ra-znimi pogoji. Ugotovili smo, da je algoritem octree deloval večinoma najbo-lje. Algoritem uniformna mreža je primeren le, če ni problematično zasestiveliko delovnega pomnilnika in imamo enakomerno porazdeljene objekte poprostoru.

Keywords

algoritmi;zaznavanje trkov;primerjava;implementa-cija;računalniške igre;realno časovno;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [T. Korda Mlakar]
UDC: 004.96:004.42(043.2)
COBISS: 95966467 Link will open in a new window
Views: 233
Downloads: 19
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Collision detection algorithms in computer games
Secondary abstract: In the thesis, we implemented varius algorithms for collision detectionin games. We tested and benchmarked how fast they executed under differentconditions. We found that the algorithm octree generally worked the best. Analgorithm uniform grid is appropriate only when it is no problem in allocatinga lot of memory and when object are positioned uniformly across the space.
Secondary keywords: algorithm;collision detection;comparison;implementation;computer games;real time;
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: III, 28 f.
ID: 13272536
Recommended works:
, doktorska disertacija
, diplomsko delo
, no subtitle data available