论文信息 - A Counterexample to a Diameter Algorithm for Convex Polygons

A Counterexample to a Diameter Algorithm for Convex Polygons

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.

Godfried T. Toussaint | Binay K. Bhattacharya

[1] Martin A. Fischler. Fast algorithms for two maximal distance problems with applications to image analysis , 1980, Pattern Recognit..

[2] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[4] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.

[5] Wesley E. Snyder,et al. Finding the Extrema of a Region , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] David Avis,et al. A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..

[7] M.,et al. Statistical and Structural Approaches to Texture , 2022 .

[8] Godfried T. Toussaint,et al. On the multimodality of distances in convex polygons , 1982 .

[9] David P. Dobkin,et al. On a general method for maximizing and minimizing among certain geometric problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[11] Allen R. Hanson,et al. Experiments in Schema-Driven Interpretation of a Natural Scene , 1981 .