On Indexing Line Segments

In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight line segments to enable efficient retrieval of all line segments that (i) go through a specified point, or (ii) intersect a specified line segment. We propose a data organization, based on the Hough transform, that can be used to solve both retrieval problems efficiently. In addition, the proposed structure can be used for approximate retrievals, finding all line segments that pass close to a specified point. We show, through analysis and experiment, that the proposed technique always does as well as or better than retrieval based on minimum bounding rectangles or line segment end-points.

[1]  H. V. Jagadish.  Spatial search with polyhedra , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[2]  Klaus H. Hinrichs,et al.  The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects , 1983, International Workshop on Graph-Theoretic Concepts in Computer Science.

[3]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[5]  Christos Faloutsos,et al.  An Efficient Pictorial Database System for PSQL , 1988, IEEE Trans. Software Eng..

[6]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[7]  Ingemar J. Cox,et al.  Predicting and Estimating the Accuracy of a Subpixel Registration Algorithm , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Peter M. Will,et al.  Grid Coding: A Preprocessing Technique for Robot and Machine Vision , 1971, IJCAI.

[9]  Jack A. Orenstein.  Redundancy in spatial databases , 1989, SIGMOD '89.

[10]  Hanan Samet,et al.  Storing a collection of polygons using quadtrees , 1985, TOGS.

[11]  Christos Faloutsos,et al.  The A dynamic index for multidimensional ob-jects , 1987, Very Large Data Bases Conference.

[12]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

[13]  Hanan Samet,et al.  Hierarchical representations of collections of small rectangles , 1988, CSUR.

[14]  Markku Tamminen.  Performance analysis of cell based geometric file organizations , 1983, Comput. Vis. Graph. Image Process..

[15]  Rangachar Kasturi,et al.  Information Extraction of Paper-Based Maps , 1988, IEEE Trans. Software Eng..

[16]  Hanan Samet,et al.  A consistent hierarchical representation for vector data , 1986, SIGGRAPH.

[17]  Peter Widmayer,et al.  The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.