On the Problem of Convex Hull in Linear Expected Time
碩士 === 國立臺北大學 === 電機工程學系 === 104 === The convex hull is the smallest convex set that contains all the points in the Euclidean plane. It is isomorphism of Voronoi diagrams, Delaunay triangulation, and can be applied to image processing, geographic information system and military systems. In this arti...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61998440869481133561 |
| id |
ndltd-TW-104NTPU0442011 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-104NTPU04420112016-11-04T04:14:26Z http://ndltd.ncl.edu.tw/handle/61998440869481133561 On the Problem of Convex Hull in Linear Expected Time 線性期望時間之凸包問題研究 LIN, CHI-CHAO 林啟超 碩士 國立臺北大學 電機工程學系 104 The convex hull is the smallest convex set that contains all the points in the Euclidean plane. It is isomorphism of Voronoi diagrams, Delaunay triangulation, and can be applied to image processing, geographic information system and military systems. In this article, we present a new and efficient algorithm by extracting those points far away from the coordinate center and removing the rest of points. The number of input points is reduced from n to n⁄logn and any of the O(n logn) time convex hull algorithms can be then applied to obtain the convex hull in O(n) expected time complexity. The algorithm runs in exact linear time in all the 100,000 experimental results. JAN, GENE-EU 詹景裕 2016 學位論文 ; thesis 21 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立臺北大學 === 電機工程學系 === 104 === The convex hull is the smallest convex set that contains all the points in the Euclidean plane. It is isomorphism of Voronoi diagrams, Delaunay triangulation, and can be applied to image processing, geographic information system and military systems. In this article, we present a new and efficient algorithm by extracting those points far away from the coordinate center and removing the rest of points. The number of input points is reduced from n to n⁄logn and any of the O(n logn) time convex hull algorithms can be then applied to obtain the convex hull in O(n) expected time complexity. The algorithm runs in exact linear time in all the 100,000 experimental results.
|
| author2 |
JAN, GENE-EU |
| author_facet |
JAN, GENE-EU LIN, CHI-CHAO 林啟超 |
| author |
LIN, CHI-CHAO 林啟超 |
| spellingShingle |
LIN, CHI-CHAO 林啟超 On the Problem of Convex Hull in Linear Expected Time |
| author_sort |
LIN, CHI-CHAO |
| title |
On the Problem of Convex Hull in Linear Expected Time |
| title_short |
On the Problem of Convex Hull in Linear Expected Time |
| title_full |
On the Problem of Convex Hull in Linear Expected Time |
| title_fullStr |
On the Problem of Convex Hull in Linear Expected Time |
| title_full_unstemmed |
On the Problem of Convex Hull in Linear Expected Time |
| title_sort |
on the problem of convex hull in linear expected time |
| publishDate |
2016 |
| url |
http://ndltd.ncl.edu.tw/handle/61998440869481133561 |
| work_keys_str_mv |
AT linchichao ontheproblemofconvexhullinlinearexpectedtime AT línqǐchāo ontheproblemofconvexhullinlinearexpectedtime AT linchichao xiànxìngqīwàngshíjiānzhītūbāowèntíyánjiū AT línqǐchāo xiànxìngqīwàngshíjiānzhītūbāowèntíyánjiū |
| _version_ |
1718391120390520832 |