A counterexample to a diameter algorithm for convex polygons |
| |
| Authors: | Bhattacharya B K Toussaint G T |
| |
| Affiliation: | School of Computer Science, McGill University, Montreal, P.Q., Canada.; |
| |
| Abstract: | Recently, Snyder and Tang [1] proposed an algorithm for finding the diameter of a convex polygon. In this note a family of convex polygons is described for which their algorithm fails. It is also pointed out that the diameter of an arbitrary simple n-vertex polygon can be computed in O(n) time. |
| |
| Keywords: | |
| 本文献已被 PubMed 等数据库收录！ |
|
