Some Convex Hull Algorithms of High Efficiency
碩士 === 淡江大學 === 資訊工程研究所 === 81 === The convex hull of a set of points in a plane is defined as the smallest convex polygon containing all points. The vertices of the convex polygon defining the hull are points from the original set. Equiv...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1993
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/07784115687649735148 |