ACM Home Page
Please provide us with feedback. Feedback
Performing boundary shape matching in spatial data
Full text pdf formatPdf (181 KB)
Source IBM Centre for Advanced Studies Conference archive
Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research table of contents
Toronto, Ontario, Canada
Page: 20  
Year of Publication: 1996
Authors
Edwin M. Knorr  Department of Computer Science, University of British Columbia, Vancouver, B.C., V6T 1Z4, Canada
Raymond T. Ng  Department of Computer Science, University of British Columbia, Vancouver, B.C., V6T 1Z4, Canada
David L. Shilvock  Department of Computer Science, University of British Columbia, Vancouver, B.C., V6T 1Z4, Canada
Sponsors
CRSNG : Natural Sci and EngRch Council of Canada
IBM Canada : IBM Canada
NRC : National Research Council - Canada
Publisher
IBM Press 
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 29,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

This paper describes a new approach to knowledge discovery among spatial objects-namely that of partial boundary shape matching. Our focus is on mining spatial data, whereby many objects called features (represented as polygons) are compared with one or more point sets called clusters. The research described has practical application in such domains as Geographic Information Systems, in which a cluster of points (possibly created by an SQL query) is compared to many natural or man-made features to detect partial or total matches of the facing boundaries of the cluster and feature. We begin by using an alpha-shape to characterize the shape of an arbitrary cluster of points, thus producing a set of edges denoting the cluster's boundary. We then provide an approach for detecting a boundary shape match between the facing curves of the cluster and feature, and show how to quantify the value of the match. Optimizations and experimental results are also provided. Finally, we describe several orientation strategies yielding signifficant performance enhancements.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
{3} H. Edelsbrunner, D. Kirkpatrick, and R. Seidel. "On the Shape of a Set of Points in the Plane", IEEE Transactions on Information Theory, 29, 4, pp. 551-559, 1983.
 
4
 
5
{5} W. J. Frawley, G. Piatetsky-Shapiro, and C. J. Matheus. "Knowledge Discovery in Databases: An Overview", Knowledge Discovery in Databases, Piatetsky-Shapiro and Frawley (eds.), AAAI/MIT Press, pp. 1-27, 1991.
 
6
 
7
 
8
{8} D. Kirkpatrick and J. Radke. "A Framework for Computational Morphology", Computational Geometry, G.Toussaint (ed.), The Netherlands: Elsevier Science Publishers B.V., 1985, pp. 217-248, 1985.
 
9
 
10
{10} W. Lu, J. Han, and B. C. Ooi. "Discovery of General Knowledge in Large Spatial Databases", Proceedings of the Far East Workshop on Geographic Information Systems, Singapore, pp. 275-289, 1993.
 
11
 
12

Collaborative Colleagues:
Edwin M. Knorr: colleagues
Raymond T. Ng: colleagues
David L. Shilvock: colleagues

Peer to Peer - Readers of this Article have also read: