|
|||||
|
|
Finding the convex hull of a simple polygon in linear time |
|
| Authors: | S.Y. Shin T.C. Woo |
| Affiliation: | Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109, U.S.A. |
| Abstract: | Though linear algorithms for finding the convex hull of a simply-connected polygon have been reported, not all are short and correct. A compact version based on Sklansky's original idea(7) and Bykat's counter-example(8) is given. Its complexity and correctness are also shown. |
| Keywords: | Convex hull Linear algorithm Computational geometry |
| 本文献已被 ScienceDirect 等数据库收录！ | |