Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Comparative Study on Polygonal Mesh Simplification Algorithms
Download
index.pdf
Date
2009-01-01
Author
Yirci, Murat
Ulusoy, İlkay
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
172
views
49
downloads
Cite This
Polygonal meshes are a common way of representing three dimensional surface models in many different areas of computer graphics and geometry processing. However, with the evolution of the technology, polygonal models are becoming more and more complex. As the complexity of the models increase, the visual approximation to the real world objects get better but there is a trade-off between the cost of processing these models and better visual approximation. In order to reduce this cost, the number of polygons in a model can be reduced by mesh simplification algorithms. These algorithms are widely used such that nearly all of the popular mesh editing libraries include at least one of them. In this work, polygonal simplification algorithms that are embedded in open source libraries: CGAL, VTK and OpenMesh are compared with the Metro geometric error measuring tool. By this way we try to supply a guidance for developers for publicly available mesh libraries in order to implement polygonal mesh simplification.
Subject Keywords
Solid modeling
,
Computed tomography
,
Magnetic resonance imaging
URI
https://hdl.handle.net/11511/95199
DOI
https://doi.org/10.1109/siu.2009.5136501
Conference Name
IEEE 17th Signal Processing and Communications Applications Conference
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
A comparative study on polygonal mesh simplification algorithms
Yirci, Murat; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2008)
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, effi...
A Non-Structural Representation Scheme for Articulated Shapes
Genctav, Asli; Tarı, Zehra Sibel (2018-10-01)
Articulated shapes are successfully represented by structural representations which are organized in the form of graphs of shape components. We present an alternative representation scheme which is equally powerful but does not require explicit modeling or discovery of structural relations. The key element in our scheme is a novel multi scale pixel-based distinctness measure which implicitly quantifies how rare a particular pixel is in terms of its geometry with respect to all pixels of the shape. The spati...
An advanced boundary element method (BEM) implementation for the forward problem of electromagnetic source imaging
Akahn-Acar, Z; Gençer, Nevzat Güneri (IOP Publishing, 2004-11-07)
The forward problem of electromagnetic source imaging has two components: a numerical model to solve the related integral equations and a model of the head geometry. This study is on the boundary element method (BEM) implementation for numerical solutions and realistic head modelling. The use of second-order (quadratic) isoparametric elements and the recursive integration technique increase the accuracy in the solutions. Two new formulations are developed for the calculation of the transfer matrices to obta...
Equipotential projection based MREIT reconstruction without potential measurements
Eyüboğlu, Behçet Murat (2007-09-02)
Magnetic resonance electrical impedance tomography (MREIT) is used to produce high resolution images of true conductivitv distribution. Images are reconstructed by utilising measurements of magnetic flux density distribution and surface potentials. Surface potential measurements are needed to reconstruct true conductivity values. In this study, a novel MREIT reconstruction algorithm is developed to generate conductivity images without utilizing the surface potential measurements. The proposed algorithm and ...
A computational model for partially plastic stress analysis of orthotropic variable thickness disks subjected to external pressure
Eraslan, Ahmet Nedim; Yedekçi, Buşra (2014-04-01)
A computational model is developed to predict the states of stressand deformation in partially plastic, orthotropic, variable thickness, nonisothermal, stationary annular disks under external pressure. Assuming a state ofplane stress and using basic equations of mechanics of a disk, Maxwell relation,Hill’s quadratic yield condition, and a Swift type nonlinear hardening law, asingle governing differential equation describing the elastic and partially plasticresponse of an orthotropic, variable thickness, non...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Yirci and İ. Ulusoy, “A Comparative Study on Polygonal Mesh Simplification Algorithms,” presented at the IEEE 17th Signal Processing and Communications Applications Conference, Antalya, Türkiye, 2009, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/95199.