An Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain

被引：1

作者：

Zhang, Yuping ^{[1
]}

Deng, Zhaori ^{[1
]}

Zhang, Ruiqi ^{[1
]}

机构：

[1] Shanghai Normal Univ, Shanghai 200234, Peoples R China

来源：

INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4 | 2013年 / 263-266卷

关键词：

Convex Hull; Monotonic Chain; Triangulation Algorithm; Mesh Data;

D O I：

10.4028/www.scientific.net/AMM.263-266.1605

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The triangulation of convex hull has the characteristics of point-set and polygon triangulation. According to some relative definitions, this paper proposed a triangulation of convex hull based on a monotonic chain. This method is better than Delaunay algorithm and is more efficient than other convex polygon algorithms. It is a good algorithm.

引用

页码：1605 / 1608

页数：4

共 5 条

[1] Towards compatible triangulations
Aichholzer, O
Aurenhammer, F
Hurtado, F
Krasser, H
[J]. THEORETICAL COMPUTER SCIENCE, 2003, 296 (01) : 3 - 13
[2] COMPUTATIONAL GEOMETRY
FORREST, AR
[J]. PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL AND PHYSICAL SCIENCES, 1971, 321 (1545): : 187 - &
[3] Fortune S., 1995, COMPUTING EUCLIDEAN, P231
[4] Prepatata F. P., 1985, COMPUTATIONAL GEOMET
[5] Regular triangulations of dynamic sets of points
Vigo, M
Pla, N
Cotrina, J
[J]. COMPUTER AIDED GEOMETRIC DESIGN, 2002, 19 (02) : 127 - 149

← 1 →