Longest-edge -section algorithms: Properties and open problems

详细信息    查看全文

• 作者：Sergey Korotov^a ; ^{sergey.korotov@hib.no" class="auth_mail" title="E-mail the corresponding author} ; Á ; ngel Plaza^b ; ^{angel.plaza@ulpgc.es" class="auth_mail" title="E-mail the corresponding author} ; José ; P. Suá ; rez^b ; ^{josepablo.suarez@ulpgc.es" class="auth_mail" title="E-mail the corresponding author}
• 关键词：65N50 ; 65N30 ; 65M50 ; 65Y20
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2016
• 出版时间：February 2016
• 年：2016
• 卷：293
• 期：Complete
• 页码：139-146
• 全文大小：379 K

文摘

In this paper we survey all known (including own recent results) properties of the longest-edge n$n$-section algorithms. These algorithms (in classical and recently designed conforming form) are nowadays used in many applications, including finite element simulations, computer graphics, etc. as a reliable tool for controllable mesh generation. In addition, we present a list of open problems arising in and around this topic.