Primerjava algoritmov za rekonstrukcijo 3D modelov iz volumetričnih podatkov : diplomsko delo

Lukić, Miloš (author), Marolt, Matija (mentor)

Cilj diplomske naloge je implementacija in primerjava algoritmov za rekonstrukcijo površin iz rezultatov segmentacije 3D volumetričnih podatkov. V že izdelan program za segmentacijo in prikazovanje modelov NeckVeins je implementiran pristop Multi-level partition of unity za generiranje uteženih lokalnih implicitnih funkcij. Iz omenjenih funkcij, ki aproksimirajo lokalno obnašanje vhodnih točk, je s postopkom izčrpne Bloomenthalove poligonizacije ustvarjen 3D model. Algoritem je optimiziran z uporabo k-d drevesa za iskanje najbližjih sosedov in s podporo za paralelno delovanje na večprocesorskih sistemih. Rezultat je javanski program, pri katerem lahko z različnimi parametri uravnavamo natančnost, hitrost in gladkost končnega 3D modela. Namesto dosedanje neposredne poligonizacije volumna s statično ločljivostjo se v algoritmu MPUI ustvarjena implicitna funkcija lahko rasterizira s poljubnim algoritmom za poligonizacijo implicitnih površin.

• Language: Slovenian
• Keywords: večnivojska delitev enote, implicitne funkcije, poligonizacija, računalništvo, računalništvo in informatika, univerzitetni študij, diplomske naloge
• Work type: Bachelor thesis/paper
• Typology: 2.11 - Undergraduate Thesis
• Organization: FRI - Faculty of Computer and Information Science
• Publisher: M. Lukić
• Year: 2014
• Number of pages: 49 str.
• PID: 20.500.12556/RUL-29488
• COBISS.SI-ID: 1536091843
• Publication date in RUL: 18.09.2014

Secondary language

• Language: English
• Title: A comparison of algorithms for 3D model reconstruction from volumetric data

Abstract

The aim of the thesis is the implementation and comparison of algorithms for reconstructing 3D models from the segmented volumetric data. Multi-level partition of unity approach for generating weighted local implicit functions is implemented to existing program for visualising 3D models, NeckVeins. These functions are used to approximate local behaviour of input points. 3D model is then created using exhaustive Bloomenthal polygonization. The algorithm is optimized with the use of k-d trees for finding nearest neighbours and with support for parallel operation on multiprocessor systems. The result is a Java program with a variety of different parameters which control the accuracy, speed and smoothness of the final 3D model. Instead of a direct volume polygonization with static resolution, MPUI creates an implicit function that can be rasterized with any algorithm for implicit surface polygonization and is able to provide us with user-defined resolution of triangles.

• Keywords: multi-level partition of unity, implicit functions, polygonization, computer science, computer and information science, diploma