Triangulated spatial models and neighbourhood search: an experimental comparison with quadtrees

Visual Computer

Volumn 15, Issue 5, 1999, Pages 235-248

  Jones, Christopher B ^a   Ware, J Mark ^a   Eynon, Christopher D ^a  

^a UNIVERSITY OF GLAMORGAN   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; QUEUEING THEORY; RESPONSE TIME (COMPUTER SYSTEMS);

DELAUNAY TRIANGULATION; NEIGHBOURHOOD SEARCH; PRIORITY QUEUE; QUADTREE; TRIANGULATED SPATIAL MODEL;

ONLINE SEARCHING;

EID: 0033175329     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003710050175     Document Type: Article

References (22)

1. Arya S, Mount DM, Netanyahu NS, Silverman R, Wu A (1994) An optimal algorithm for approximate nearest neighbour searching. Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, ACM, pp 573-582
2. Baehmann PL, Wittchen SL, Shephard MS, Grice KR, Yerry MA (1987) Robust, geometrically based, automatic two-dimensional mesh generation. Int J Numerical Methods Eng 24:1043-1078
3. Chew PL (1989) Constrained Delaunay triangulations. Algorithmica 4:97-108
4. DeLucia A, Black T (1987) A comprehensive approach to automatic feature generalization. Proceedings of the 13th International Cartographic Conference, Morelia, Mexico, International Cartographic Association, Morelia, Mexico, pp 169-191
5. Hoel EG, Samet H (1991) Efficient processing of spatial queries in line segment databases. In: Gunther O, Schek H-J (eds) Advances in spatial databases: proceedings of the 2nd Symposium on the Design and Implementation of Large Spatial Databases (SSD '91) (Lecture Notes in Computer Science, vol 525) Springer. Zurich, pp 237-256
6. Hoel EG, Sarnet H (1992) A qualitative comparison study of data structures for large line segment databases. ACM SIGMOD Record 21:205-214
7. Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Egenhofer MJ, Herring JR (eds) Advances in spatial databases. (Lecture Notes in Computer Science, vol 951) Springer, Berlin Heidelberg New York, pp 237-256
8. Jones CB, Ware JM (1998) Proximity relations with triangulated spatial models. Comput J 41:71-83
9. Jones CB, Kidner DB, Ware JM (1994) The implicit triangulated irregular network and multiscale spatial databases. Comput J 37:43-57
10. Jones CB, Bundy GL, Ware JM (1995) Map generalisation with a triangulated data structure. Cartography Geogr Information Syst 22:317-331
11. Kriegel H-P, Horn H, Schiwietz M (1991) The performance of object decomposition techniques for spatial query processing. Advances in spatial databases: proceedings of the 2nd Symposium on the Design and Implementation of Large Spatial Databases (SSD '91) (Lecture Notes in Computer Science, vol 525) Springer, Berlin Heidelberg New York, pp 257-276
12. Lee DR, Drysdale RL (1981) Generalization of Voronoi diagrams in the plane. SIAM J Comput 10:73-87
13. Lee DT, Lin AK (1986) Generalized Delaunay triangulation for planar graphs. Discrete Computat Geom 1:201-217
14. Nelson RC, Samet H (1986) A consistent hierarchical representation for vector data. Computer Graphics (SIGGRAPH '86 Proceedings) Vol 20, No 4, 197-206
15. Orenstein JA (1989) Strategies for optimising the use of redundancy in spatial databases. 1st Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, Calif., Lecture Notes in Computer Science Vol 409, Springer, Berlin Heidelberg New York, pp 115-134
16. Peucker TK, Fowler RJ, Little JJ, Mark DM (1978) The triangulated irregular network. ASP/ACSM Digital Terrain Models (DTM) Symposium, ACSM, Falls Church, Virginia, 516-540
17. Preparata FP, Shamos MI (1988) Computational geometry. Texts and monographs in computer science. Springer, New York
18. Samet H (1990) The design and analysis of spatial data structures. Addison-Wesley, Reading, Mass.
19. Schiwietz M, Kriegel H-P (1993) Query processing of spatial objects: complexity versus redundancy. In: Abel D, Ooi BC (eds) Advances in spatial databases. (Lecture Notes in Computer Science, vol 692) Springer, Berlin Heidelberg New York, pp 377-396
20. Shamos MI, Hoey D (1975) Closest-point problems. The 16th Annual IEEE Symposium on Foundations of Computer Science, University of California, Berkeley. IEEE pp 151-162
21. Sibson R (1978) Locally equiangular triangulations. Comput J 21:243-245
22. Storer JA, Rief JH (1994) Shortest paths in the plane with polygonal obstacles. J ACM 41:982-1012