Proximity Search with a Triangulated Spatial Model

Computer Journal

Volumn 41, Issue 2, 1998, Pages 71-83

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

^a UNIVERSITY OF GLAMORGAN   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0542396556     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/41.2.71     Document Type: Article

References (28)

1. Preparata, F. P. and Shamos, M. I. (1988) Computational Geometry. Texts and Monographs in Computer Science. Springer-Verlag, New York.
2. Kriegel, H.-P., Horn, H. and Schiwietz, M. (1991) The performance of object decomposition techniques for spatial query processing. Advances in Spatial Databases: Proc. 2nd Symp. on the Design and Implementation of Large Spatial Databases (SSD'91). Lecture Notes in Computer Science, 525, 257-276. Springer-Verlag.
3. Guttman, A. (1984) R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD Int. Conf. on the Management of Data, pp. 47-57. ACM, Boston, MA.
4. + tree: a dynamic index for multidimensional objects. 13th Int. Conf. on Very Large Databases, pp. 507-518.
5. Kirkpatrick, D. (1983) Optimal search in planar subdivisions. SIAM J. Comput., 12, 28-35.
6. De Floriani, L. (1989) A pyramidal data structure for triangle-based surface description. IEEE Comput. Graphics Applic., 9, 67-78.
7. De Floriani, L., Gattorna, G., Marzano, P. and Puppo, E. (1994) Spatial queries on a hierarchical terrain model. 6th Int. Symp. on Spatial Data Handling SDH 94, pp. 819-834. International Geographical Union, Edinburgh.
8. Gold, C. M., Charters, T. D. and Ramsden, J. (1977) Automated contour mapping using triangular element data structures and an interpolant over each triangular domain. Comput. Graphics (ACM), 2, 170-175.
9. Peucker, T. K., Fowler, R. J., Little, J. J. and Mark, D. M. (1978) The triangulated irregular network. ASP/ACSM Digital Terrain Models (DTM) Symp., pp. 516-540. ACSM, Falls Church, VA.
10. Kraak, M. J. (1993) Cartographic terrain modeling in a three-dimensional GIS environment. Cartography Geogr. Inf. Syst., 20, 13-18.
11. Jones, C. B. (1989) Data structures for three-dimensional spatial information systems in geology. Int. J. Geogr. Inf. Syst., 3, 15-31.
12. Jones, C. B., Kidner, D. B. and Ware, J. M. (1994) The implicit triangulated irregular network and multiscale spatial databases. Comput. J., 37, 43-57.
13. De Floriani, L. and Puppo, E. (1988) Constrained Delaunay triangulation for multiresolution surface description. 9th Int. Conf. on Pattern Recognition, Rome, pp. 566-569. IEEE, Washington, DC.
14. DeLucia, A. and Black, T. (1987) A comprehensive approach to automatic feature generalization. Proc. 13th Int. Cartographic Conf., pp. 169-191. International Cartographic Association, Mexico.
15. Jones, C. B., Bundy, G. Ll. and Ware, J. M. (1995) Map generalization with a triangulated data structure. Cartogr. Geogr. Inf. Syst., 22, 317-331.
16. Frank, A. and Kuhn, W. (1986) Cell graphs: a provable correct method for the storage of geometry. 2nd Int. Symp. on Spatial Data Handling, Seattle, WA, pp. 411-436. International Geographical Union, Williamsville, NY.
17. Egenhofer, M. and Jackson, J. (1989) A topological data model for spatial databases. Symp on the Design and Implementation of Large Spatial Databases. Lecture Notes in Computer Science, 409, 271-286. Springer-Verlag, Berlin.
18. Baehmann, P. L., Wittchen, S. L., Shephard, M. S., Grice, K. R. and Yerry, M. A. (1987) Robust, geometrically based, automatic two-dimensional mesh generation. Int. J. Numer. Methods Engng., 24, 1043-1078.
19. Storer, J. A. and Rief, J. H. (1994) Shortest paths in the plane with polygonal obstacles. J. Assoc. Comput. Mach., 41, 982-1012.
20. De Floriani L. and Magillo, P. (1994) Visibility algorithms on triangulated digital terrain models. Int. J. Geogr .Inf. Syst., 8, 13-41.
21. Dickerson, M. T., Drysdale, R. L. S. and Sack, J.-D. (1992) Simple algorithms for enumerating interpoint distances and finding nearest neighbours. Int. J. Comput. Geom. Appl., 2, 221-239.
22. Dickerson, M. T. and Drysdale, R. S. (1990) Fixed-radius near neighbours search algorithms for points and segments. Inf. Proc. Lett., 35, 269-273.
23. Aurenhammer, F. (1991) Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surveys, 23, 345-405.
24. Shamos, M. I. and Hoey, D. (1975) Closest-point problems. 16th Ann. IEEE Symp. on Foundations of Computer Science, pp. 151-162. IEEE Computer Society Press, New York.
25. Okabe, A., Boots, B. and Sugihara, K. (1992) Spatial Tessellations - Concepts and Applications of Voronoi Diagrams. Wiley, Chichester.
26. Chew, L. P. (1989) Constrained Delaunay triangulations. Algorithmica, 4, 97-108.
27. Lee, D. T. and Lin, A. K. (1986) Generalized Delaunay triangulation for planar graphs. Discrete Comput. Geom., 1, 201-217.
28. Lee, D. R. and Drysdale, R. L. (1981) Generalization of Voronoi diagrams in the plane. SIAM J. Computing, 10, 73-87.