On the Shape of a Set of Points

Inspired by recent developments in computational morphology, this paper discusses their potential impact on research undertaken in the field of spatial analysis addressing the characterization and recognition of form in point sets. A brief discussion of point pattern recognition methods now common in spatial analysis is included, pointing to their limitations and questioning their success. The main focus of the paper, however, is the examination of recent methods of geometric decomposition that appear more useful for solving questions concerning form. New techniques based in computational morphology may very well revolutionize the characterization of point sets for spatial analysts. Some of these techniques are referenced and briefly discussed here, including their potential applications to point pattern recognition problems in spatial analysis.

[1]  P. J. Clark,et al.  Distance to Nearest Neighbor as a Measure of Spatial Relationships in Populations , 1954 .

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

[3]  Selim G. Akl,et al.  EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS. , 1979 .

[4]  D. Kirkpatrick,et al.  A Framework for Computational Morphology , 1985 .

[5]  G. Toussaint.  A Graph-Theoretical Primal Sketch , 1988 .

[6]  Richard C. Dubes,et al.  A Variation on a Nonparametric Clustering Method , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Roderick Urquhart,et al.  Graph theoretical clustering based on limited neighbourhood sets , 1982, Pattern Recognit..

[8]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  John D. Radke.  Pattern recognition in circuit networks , 1982 .

[10]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[11]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[12]  B. Boots.  Weighting Thiessen Polygons , 1980 .

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

[14]  Monique Pavel.  Algebraic, topological and categorical aspects of pattern recognition: A survey , 1981, Pattern Recognit..

[15]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[16]  Kanti V. Mardia,et al.  Analysis of Central Place Theory. , 1978 .

[17]  G. Krishna,et al.  Agglomerative clustering using the concept of mutual nearest neighbourhood , 1978, Pattern Recognit..

[18]  Anil K. Jain,et al.  Testing for Uniformity in Multidimensional Data , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  D. Welty Lefever,et al.  Measuring Geographic Concentration by Means of the Standard Deviational Ellipse , 1926, American Journal of Sociology.

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

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

[22]  A. Getis,et al.  Probability model approach to map pattern analysis , 1977 .

[23]  D. Avis,et al.  REMARKS ON THE SPHERE OF INFLUENCE GRAPH , 1985 .

[24]  M. Dacey.  THE SPACING OF RIVER TOWNS , 1960 .

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