|
|
Robust feature curve detection in 3D surface models
Hmíra, Peter ; Dupej, Ján (advisor) ; Pelikán, Josef (referee)
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joining properly. There is a challenge to not only detect features in the noisy 3D-data obtained from the digital scanners. Moreover, most of the algorithms even when they are robust to noise, they lose the feature information near the T-shaped junctions as the triplet of lines ``confuses'' the algorithm so it treats it as a plane. Powered by TCPDF (www.tcpdf.org)
|
|
|
Generic algorithms for polygonal mesh manipulation
Hmíra, Peter ; Kolomazník, Jan (advisor) ; Dupej, Ján (referee)
This bachelor thesis analyses algorithms working with the volume data, especially the triangle or polygon mesh. The results of the analysis are applied in the design of the generic library which can be templated with any implementa- tion of mesh satisfying requirements of the library. The library is written in C++ using the norm C++11 with assistance of the boost library. The choice of the programming language is supported by the strong emphasis on the run-time per- formance as well as the capabilities of C++ to analyze a templated code during the compile-time. Later in thesis is described the implemenation of the library, usage of the algorithms and their concepts, the purpose of the adapters - tools that allow to run algorithms over such an implementation of the mesh that is not properly designed for the algorithm. The technique used in the development of this library can be later applied in the library developement, thus adding new algorithms to the library.
|
|
|
Robust feature curve detection in 3D surface models
Hmíra, Peter
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joining properly. There is a challenge to not only detect features in the noisy 3D-data obtained from the digital scanners. Moreover, most of the algorithms even when they are robust to noise, they lose the feature information near the T-shaped junctions as the triplet of lines ``confuses'' the algorithm so it treats it as a plane. Powered by TCPDF (www.tcpdf.org)
|
|
|
Robust feature curve detection in 3D surface models
Hmíra, Peter
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joining properly. There is a challenge to not only detect features in the noisy 3D-data obtained from the digital scanners. Moreover, most of the algorithms even when they are robust to noise, they lose the feature information near the T-shaped junctions as the triplet of lines ``confuses'' the algorithm so it treats it as a plane. Powered by TCPDF (www.tcpdf.org)
|
|
|
Robust feature curve detection in 3D surface models
Hmíra, Peter ; Dupej, Ján (advisor) ; Pelikán, Josef (referee)
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joining properly. There is a challenge to not only detect features in the noisy 3D-data obtained from the digital scanners. Moreover, most of the algorithms even when they are robust to noise, they lose the feature information near the T-shaped junctions as the triplet of lines ``confuses'' the algorithm so it treats it as a plane. Powered by TCPDF (www.tcpdf.org)
|
|
|
Generic algorithms for polygonal mesh manipulation
Hmíra, Peter ; Kolomazník, Jan (advisor) ; Dupej, Ján (referee)
This bachelor thesis analyses algorithms working with the volume data, especially the triangle or polygon mesh. The results of the analysis are applied in the design of the generic library which can be templated with any implementa- tion of mesh satisfying requirements of the library. The library is written in C++ using the norm C++11 with assistance of the boost library. The choice of the programming language is supported by the strong emphasis on the run-time per- formance as well as the capabilities of C++ to analyze a templated code during the compile-time. Later in thesis is described the implemenation of the library, usage of the algorithms and their concepts, the purpose of the adapters - tools that allow to run algorithms over such an implementation of the mesh that is not properly designed for the algorithm. The technique used in the development of this library can be later applied in the library developement, thus adding new algorithms to the library.
|
guest ::
