Minimum degree triangulation for rectangular domains

被引：0
|
作者：
Liu, PF [1 ]
机构：
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
来源：
INFORMATION PROCESSING LETTERS | 2005年 / 96卷 / 04期
关键词：
design of algorithms; mesh generation; rectangle and convex polygons; min-max degree triangulation;
D O I：
10.1016/j.ipl.2005.07.002
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper describes an optimal triangulation algorithm for rectangles. We derive lower bounds on the maximum degree of triangulation, and show that our triangulation algorithm matches the lower bounds. Several important observations are also made, including a zig-zag condition that can verify whether a triangulation can minimizes the maximum degree to 4 or not. In addition, this paper identifies the necessary and sufficient condition that there exists a maximum degree 4 triangulation for convex polygons, and gives a linear time checking algorithm. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：128 / 135
页数：8
相关论文
共 50 条
12345