CASIA OpenIR  > 模式识别国家重点实验室  > 多媒体计算与图形学
各向同性三角形重新网格化方法综述
严冬明; 胡楷模; 郭建伟; 王逸群; 张义宽; 张晓鹏
Source Publication计算机科学
2017
Volume44Issue:8Pages:10-19
Abstract三维网格模型的重新网格化是计算机图形学中的重要内容,是许多几何应用的关键组成部分。近年来迅速发展的三维处理技术,如有限元模拟、计算机动画、三维打印等,对网格质量的要求不断提升,促进了三维网格模型重新网格化的持续发展,产生了许多新的重新网格化技术。本文首先介绍三角形网格质量评估的标准,然后概述了各项同性重新网格化的最新进展,并详细研究比较了各种重新网格化算法的优缺点,最后我们对未来的研究提出新的问题与方向。
Other AbstractRemeshing of 3D mesh models is an important task of computer graphics, and it is a key component of many geometric algorithms. In recent years, the rapid development of 3D applications, such as finite element modeling, computer animation, 3D printing, require higher quality of mesh, and promotes the rapid development of remeshing of 3D mesh models, resulting in many new remeshing technology. In this paper, we first introduce the evaluation criteria of meshing quality. Then, we survey the latest development in isotropic remeshing and discuss the advantages and disadvantages of various remeshing algorithm. Finally, we discuss some new problems and directions for future research.
KeywordRemeshing
Document Type期刊论文
Identifierhttp://ir.ia.ac.cn/handle/173211/14029
Collection模式识别国家重点实验室_多媒体计算与图形学
Corresponding Author严冬明
Recommended Citation
GB/T 7714
严冬明,胡楷模,郭建伟,等. 各向同性三角形重新网格化方法综述[J]. 计算机科学,2017,44(8):10-19.
APA 严冬明,胡楷模,郭建伟,王逸群,张义宽,&张晓鹏.(2017).各向同性三角形重新网格化方法综述.计算机科学,44(8),10-19.
MLA 严冬明,et al."各向同性三角形重新网格化方法综述".计算机科学 44.8(2017):10-19.
Files in This Item: Download All
File Name/Size DocType Version Access License
remesh_final.pdf(1239KB)期刊论文作者接受稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[严冬明]'s Articles
[胡楷模]'s Articles
[郭建伟]'s Articles
Baidu academic
Similar articles in Baidu academic
[严冬明]'s Articles
[胡楷模]'s Articles
[郭建伟]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[严冬明]'s Articles
[胡楷模]'s Articles
[郭建伟]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: remesh_final.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.