Polygonal meshes are a common way of representing 3D surface models in many
different areas of computer graphics and geometry processing. However, these
models are becoming more and more complex which increases the cost of processing
these models. In order to reduce this cost, mesh simplification algorithms are
developed. Another important property of a polygonal mesh model is that whether it
is regular or not. Regular meshes have many advantages over the irregular ones in
terms of memory requirements, efficient processing, rendering etc. In this thesis
work, both mesh simplification and regular remeshing algorithms are studied.
Moreover, some of the popular mesh libraries are compared with respect to their
approaches and performance to the mesh simplification. In addition, mesh models
with disk topology are remeshed and converted to regular ones.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12610074/index.pdf |
| Date | 01 September 2008 |
| Creators | Yirci, Murat |
| Contributors | Ulusoy, Ilkay |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0015 seconds