Thesis Details

Segmentace polygonálního modelu

Bachelor's Thesis Student: Švancár Matúš Academic Year: 2018/2019 Supervisor: Španěl Michal, Ing., Ph.D.
English title
Polygonal Mesh Segmentation
Language
Czech
Abstract

This bachelor thesis analyzes and approaches the issue of segmentation of polygonal models. It presents a design of an interactive method inspired by the method described in the Interactive Mesh Segmentation Based on Feature Preserving Harmonic Field. The method uses graph-cut and is implemented as a web application. The application supports .obj and .stl file formats, allows the user to load a model, draw sketches representing foreground and background on the surface of the model, and to start segmentation. Once completed, the user can download the resulting models or continue segmenting with one of them.

Keywords

segmentation, mesh, graph cut, geodesic distance, web, client-server, Node.js, Three.js, CGAL, OpenMesh

Department
Department of Computer Graphics and Multimedia FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade B
Date
13 June 2019
Reviewer
Kodym Oldřich, Ing., Ph.D.
Committee
Herout Adam, prof. Ing., Ph.D. (DCGM FIT BUT), předseda
Drábek Vladimír, doc. Ing., CSc. (DCSY FIT BUT), člen
Rozman Jaroslav, Ing., Ph.D. (DITS FIT BUT), člen
Rychlý Marek, RNDr., Ph.D. (DIFS FIT BUT), člen
Španěl Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Citation
ŠVANCÁR, Matúš. Segmentace polygonálního modelu. Brno, 2019. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2019-06-13. Supervised by Španěl Michal. Available from: https://www.fit.vut.cz/study/thesis/19472/
BibTeX 
@bachelorsthesis{FITBT19472,
    author = "Mat\'{u}\v{s} \v{S}vanc\'{a}r",
    type = "Bachelor's thesis",
    title = "Segmentace polygon\'{a}ln\'{i}ho modelu",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2019,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/19472/"
}

Theses

Back to top