Constructing the Planar Convex Hulls by Quadrilateral Devour Algorithm

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 會議論文 > Item 987654321/95753

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/95753

题名:	Constructing the Planar Convex Hulls by Quadrilateral Devour Algorithm
作者:	Chao, Louis R.;Liu, Hoo-Chen;Kou, Ying-Feng
贡献者:	淡江大學資訊工程學系
关键词:	平面凸殼;四邊貪婪演算法;凸殼建構;四邊演算法;Planar Convex Hull;Quadrilateral Devour Algorithm;Convex Hull Construction;Quadrilateral Algorithm
日期:	1994-12
上传时间:	2014-02-13
摘要:	The algorithm to construct the convex hull for a set of finite points in two-dimensional Euclidean space has been applied in many applications. In this paper, a modified quadrilateral algorithm is proposed to construct the convex hull. This method is based on a divide-and- conquer strategy and divides the input finite points into two parts. All the quadrilaterals can be found in each part by just comparing the x-coordinate of every point and the internal points are eliminated. When all of the points have been processed, the vertices of the convex hull belong to all the vertices of the quadrilaterals. Some distributed data samples are examined to demonstrate the efficiency of this algorithm. The average and worst cases are also discussed.
關聯:	1994 International Computer Symposium Conference Proceeding Volume 2 of 2，頁744-749
显示于类别:	[資訊工程學系暨研究所] 會議論文

文件中的档案:

档案	大小	格式	浏览次数
Constructing the Planar Convex Hulls by Quadrilateral Devour Algorithm_西文摘要.docx	13Kb	Microsoft Word	123	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章