Poligonal sadeleştirme algoritmalarının karşılaştırılması.

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümü, Türkiye

Tezin Onay Tarihi: 2008

Tezin Dili: İngilizce

Öğrenci: Murat Yirci

Danışman: İLKAY ULUSOY

Özet:

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.