A qualitative comparison study of data structures for large line segment databases
- 1 June 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 21 (2) , 205-214
- https://doi.org/10.1145/130283.130316
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- Redundancy in spatial databasesPublished by Association for Computing Machinery (ACM) ,1989
- Analysis of object oriented spatial access methodsPublished by Association for Computing Machinery (ACM) ,1987
- A population analysis for hierarchical data structuresPublished by Association for Computing Machinery (ACM) ,1987
- A consistent hierarchical representation for vector dataACM SIGGRAPH Computer Graphics, 1986
- Storing a collection of polygons using quadtreesACM Transactions on Graphics, 1985
- The Grid FileACM Transactions on Database Systems, 1984
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- A class of data structures for associative searchingPublished by Association for Computing Machinery (ACM) ,1984
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981