Complexity, convexity, and unimodality

A class of polygons termedunimodal is introduced. LetP = P1,p2,...,pnbe a simplen-vertex polygon. Given a fixed vertex or edge, several definitions of the distance between the fixed vertex or edge and any other vertex or edge are considered. For a fixed vertex (edge), a distance measure defines a distance function as the remaining vertices (edges) are traversed in order. If for every vertex (edge) ofP a specified distance function is unimodal thenP is a unimodal polygon in the corresponding sense. Relationships between unimodal polygons, in several senses, andconvex polygons are established. Several properties are derived for unimodal polygons when the distance measure is the euclidean distance between vertices of the polygons. These properties lead to very simple 0(n) algorithms for solving a variety of problems that occur in computational geometry and pattern recognition. Furthermore, these algorithms establish that convexity is not the key factor in obtaining linear-time-complexity for solving these problems. The paper closes with several open questions in this area.

[1]  D. T. Lee,et al.  The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..

[2]  Luigi P. Cordella,et al.  Concavity Point Detection by Iterative Arrays , 1974, Comput. Graph. Image Process..

[3]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

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

[6]  D. T. Lee,et al.  A Note on the all Nearest-Neighbor Problem for Convex Polygons , 1979, Inf. Process. Lett..

[7]  V. G. Bolti︠a︡nskiĭ,et al.  The decomposition of figures into smaller parts , 1980 .

[8]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.

[9]  E. Altman.  On a Problem of P. Erdös , 1963 .

[10]  Leo Moser,et al.  On The Different Distances Determined By n Points , 1952 .

[11]  Franco P. Preparata,et al.  Testing a Simple Polygon for Monotonicity , 1981, Inf. Process. Lett..

[12]  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).

[13]  B. Chazelle.  Computational geometry and convexity , 1980 .

[14]  G. Toussaint,et al.  On Geometric Algorithms that use the Furthest-Point Voronoi Diagram , 1985 .

[15]  Kenneth J. Supowit,et al.  The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.

[16]  Alain Fournier,et al.  Comments on the All Nearest-Neighbor Problem for Convex Polygons , 1979, Inf. Process. Lett..

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

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

[19]  Godfried T. Toussaint,et al.  Computational Geometric Problems in Pattern Recognition , 1982 .

[20]  Theodosios Pavlidis,et al.  Representation of figures by labeled graphs , 1972, Pattern Recognit..

[21]  R. V. Benson.  Euclidean Geometry and Convexity , 1966 .

[22]  Godfried T. Toussaint,et al.  A Counterexample to a Diameter Algorithm for Convex Polygons , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Godfried T. Toussaint.  The symmetric all-furthest- neighbor problem , 1983 .