|Table of Contents|

Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2004年06期
Page:
590-594
Research Field:
Publishing date:

Info

Title:
Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain
Author(s):
ZHANG Yu-pingJIANG Shou-wei
School of Mechanical and Dynamic Engineering,Shanghai Jiaotong University,Shanghai 200030, China
Keywords:
convex hull monotonic chain triangulation algorithm mesh data
PACS:
TP391.7
DOI:
-
Abstract:
According to some relative definations, 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 in the simplification, opt imizat ion, compression and transfer of vector diagram meshes.

References:

[ 1] Hearn D. 计算机图形学[M] . 蔡士杰译. 北京: 电子工业出版社, 1998.
[ 2] Prepatata F P. Computational geometry: An introduction[M] . New York: Springer-Verlag, 1985.
[ 3] Aichholzer O. Towards compatible triangulations[ J] . Theoretical Computer Science, 2003, 296( 1) : 3~ 13.
[ 4] Vigo M. Regular triangulations of dynamic sets of points[ J] . Computer Aided Geometric Design, 2002, 19( 2) :127~ 149.
[ 5] Fortune S. Computing in euclidean geometry[M] . New York:World Scientific Publishing Co Pte Ltd, 1995. 231~ 245.
[ 6] Forrest A R. Computational geometry[M] . Proc Royal Society, 1971, 321( 4) : 187~ 195.
[ 7] 周培德. 任意多边形三角剖分的算法[ J] . 北京理工大学学报, 1995, 15( 5) : 83~ 85.
[ 8] Lamot M. A fast polygon triangulation algorithm based on uniform plane subdivision[ J] . Computers and Graphics, 2003, 27( 2) : 239~ 253.
[ 9] Cheong O. Computing farthest neighbors on a convex polytope[ J] . Theoretical Computer Science, 2003, 296( 1) : 47~ 58.

Memo

Memo:
-
Last Update: 2013-03-11