COMPARISON OF 3D MODELS WITH NESTED CONVEX HULLS

V diplomskem delu opisujemo postopek primerjave 3D geometrijskih modelov s pomočjo vgnezdenih izbočenih lupin. Na začetku definiramo izbočeno lupino in podrobneje preučimo najpogosteje uporabljene algoritme za njeno gradnjo. To so algoritem zavijanja daril, algoritem s strategijo deli in vladaj in inkrementalni algoritem. Za zadnjega predstavimo izboljšavo, ki jo v našem programu tudi implementiramo. Sledi predstavitev programa, njegovih funkcionalnosti in uporabniškega vmesnika. Na koncu določimo cenilke za primerjavo 3D geometrijskih modelov, nad katerimi so zgrajene vgnezdene izbočene lupine. Cenilke ovrednotimo na različnih 3D geometrijskih modelih.In this thesis, the process of 3D geometric models comparison by using nested convex hulls is described. The convex hull is defined at the beginning and the most popular algorithms for its construction are described and analysed. The gift-wrapping algorithm, the divide and conquer algorithm, and the incremental algorithm are considered. The last one is implemented in our program together with some improvements. The estimators for comparing the convex hulls constructed upon the 3D geometric models are defined. By using different 3D geometric models their suitability are estimated