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 |