會議論文
| 學年 | 83 |
|---|---|
| 學期 | 1 |
| 發表日期 | 1994-12-12 |
| 作品名稱 | Constructing the Planar Convex Hulls by Quadrilateral Devour Algorithm |
| 作品名稱（其他語言） | |
| 著者 | Chao, Louis R.; Liu, Hoo-Chen; Kou, Ying-Feng |
| 作品所屬單位 | 淡江大學資訊工程學系 |
| 出版者 | |
| 會議名稱 | 1994 International Computer Symposium Conference |
| 會議地點 | 新北市, 臺灣 |
| 摘要 | 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. |
| 關鍵字 | 平面凸殼;四邊貪婪演算法;凸殼建構;四邊演算法;Planar Convex Hull;Quadrilateral Devour Algorithm;Convex Hull Construction;Quadrilateral Algorithm |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 19941212~19941215 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | Y |
| 出版型式 | 紙本 |
| 出處 | 1994 International Computer Symposium Conference Proceeding Volume 2 of 2，頁744-749 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95753 ) |