Surface meshes have become widely used since they are frequently adopted in many computer graphic applications. These meshes are often generated by isosurface representations or scanning devices. Unfortunately, these meshes are often dense and full of redundant vertices and irregular sampling. These defects make meshes not capable to support multiple applications; such as display, compression and transmission. To solve these problems and reduce the complexity, the mesh quality (connectivity regularity) must be ameliorated. Its improvement is called re-meshing. This paper presents a novel re-meshing approach based on Sphere-Tree construction. First, we approximate the original object with a dictionary of multi-dimensional geometric shapes (spheres) called Sphere-Tree which is, then, re-meshed. Finally, we use a refinement step to avoid artifacts and produce a new semi-regular mesh.
CITATION STYLE
Chihaoui, M., Elkefi, A., Bellil, W., & Amar, C. B. (2015). Sphere-tree semi-regular remesher. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9386, pp. 826–837). Springer Verlag. https://doi.org/10.1007/978-3-319-25903-1_71
Mendeley helps you to discover research relevant for your work.