Computational Geometric Problems in Pattern Recognition

This paper surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighborhood graph, polygon decomposition, and distance between sets. Some new results are presented; among them a new 0(n) algorithm for merging two convex polygons and a proof that a convex hull algorithm of Kim and Rosenfeld (35) works. Several open problems are also mentioned.

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

[2]  R. Urquhart.  Algorithms for computation of relative neighbourhood graph , 1980 .

[3]  Chak-Kuen Wong,et al.  Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

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

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

[6]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

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

[8]  Luc Devroye,et al.  On the average complexity of some bucketing algorithms , 1981 .

[9]  S. N. Maheshwari,et al.  Parallel algorithms for the convex hull problem in two dimensions , 1981, CONPAR.

[10]  Luc Devroye.  Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry , 1981 .

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

[12]  D. Coppersmith,et al.  An elementary proof of nonexistence of isometries between l p k and l q k , 1979 .

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

[14]  Frank K. Hwang,et al.  An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.

[15]  F. Frances Yao.  On the priority approach to hidden-surface algorithms , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[16]  Godfried T. Toussaint,et al.  Optimal algorithms for computing the minimum distance between two finite planar sets , 1983, Pattern Recognit. Lett..

[17]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[18]  Stig Nordbeck,et al.  Computer cartography point-in-polygon programs , 1967 .

[19]  Godfried T. Toussaint,et al.  Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets , 1983, J. Algorithms.

[20]  Godfried T. Toussaint,et al.  On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

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

[22]  Leonidas J. Guibas,et al.  On translating a set of rectangles , 1980, STOC '80.

[23]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[24]  D. T. Lee,et al.  Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.

[25]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

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

[27]  Ross Honsberger.  Games, Graphs, and Galleries , 1981 .

[28]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[29]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[30]  Godfried T. Toussaint.  Comment: Algorithms for computing relative neighbourhood graph , 1980 .

[31]  Chul E Kim.  A Linear Time Convex Hull Algorithm for Simple Polygons. , 1980 .

[32]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[33]  D. T. Lee,et al.  Location of Multiple Points in a Planar Subdivision , 1979, Inf. Process. Lett..

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

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

[36]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

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

[38]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[39]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[40]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

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