Parallel terrain triangulation

International Journal of Geographical Information Systems

Volumn 8, Issue 2, 1994, Pages 105-128

  Puppo, D ^a   Davis, L ^b   De Menthon, D ^b   A Teng, Y ^b  

^a CNR   (Italy)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY TRIANGULATION; DIGITAL ELEVATION MODEL; PARALLEL COMPUTING; TIN;

EID: 0028255232     PISSN: 02693798     EISSN: None     Source Type: Journal    
DOI: 10.1080/02693799408901989     Document Type: Article

References (50)

1. BANERJEE, S., MOUNT, D., and ROSENFELD, A., 1990, Pyramid computation of neighbor distance statistics in dot patterns. Technical report CS-TR-2429, University of Maryland, College Park, MD, U.S.A.
2. Barnhill, R. E„ 1974, Smooth interpolation over triangles. In Computer Aided Geometric Design, edited by R. E. Barnhill and R. F. Risenfeld (New York: Academic Press), pp. 4570.
3. Barrera, R., and Vazquez, A. M., 1984, A hierarchical method for representing relief. Proceedings Pecoru IX Symposium on Spatial information Technologies for Remote Sensing Today and Tomorrow, Sioux Falls, South Dakota, U.S.A., October 1984, pp. 87-92
4. BHASKAR, S. K., Rosenfeld, A., and Wu, A. Y., 1988, Parallel processing of regions represented by linear quadtrees, Computer Vision, Graphics, and Image Processing, 42(3), 371-380.
5. Bestul, T., 1989, A general technique for creating SIMD algorithms on parallel pointer-based quadtrees. Technical Report CAR TR-420, Center for Automation Research, University of Maryland, College Park, MD, U.S.A.
6. Cavendish, J. C., 1974, Automation triangulation of arbitrary planar domains for the finite element. International Journal of Numerical Methods in Engineering, 8, 679-696.
7. Chen, Z. T., and Guevara, J. A., 1987, Systematic selection of very important points (VIP) from digital terrain model for constructing triangular irregular networks. Proceedings of AUTO-CARTO 8, Baltimore, MD, U.S.A., edited by N. Chrisman (Falls Church: American Congress of Surveying and Mapping), pp. 50-60.
8. Chen, Z. T., and Tobler, W. R., 1986, Quadtree representation of digital terrain, Proceedings A UTO-CARTO 7, London, UK, September 1986, edited by M. Blakemore(London: Auto- Carto), pp. 475-484.
9. CHOW, A. L., 1980, Parallel algorithms forgeometric problems, Ph.D. dissertation, Department of Computer Science, University of Illinois, Urbana, 1L, U.S.A.
10. CHRISTMAN, D. P., 1983, Programming the Connection Machine, Master Thesis, Department of Electrical Engineering and Computer Science, M.I.T., Cambridge, MA, U.S.A.
11. Daixiun, D., and Kirkpatrick, D. G., 1987, Parallel processing for efficient subdivision search. In Proceedings ACM Symposium on Computational Geometry, (New York: ACM Press), pp. 205-214.
12. Davy, J. R., and DEW, P. M., 1989, A note on improving the performance of Delaunay triangulation. New Advances in Computer Graphics, edited by R. A. Earnshaw and B. Wyvill (Tokyo: Springer-Veriag), pp. 209-266.
13. De Floriani, L., 1989, A pyramidal data structure for triangle-based surface description, IEEE Computer Graphics & Applications, 9, 67-78.
14. De Floriani, L., Falcidieno, B., Nagy, G-, and Pienovi, C., 1984, A hierarchical structure for surface approximation, Computers & Graphics, 8, 183-193.
15. De Floriani, L., Falcidieno, B., and Pienovi, C., 1985, Delaunay-based representation of surfaces defined over arbitrarily shaped domains. Computor Vision, Graphics, and Image Processing, 32, 127-140.
16. De Floriani, L., and Puppo, E., 1992, A hierarchical triangle-based model for terrain description, Theories and Methods of Spatio-Temporal Reasoning in Geographic Space, edited by A. U. Frank, I. Campari, and U. Formentini, Lecture Notes in Computer Science, N. 639 (Berlin Heidelberg: Springer-Veriag), pp. 236-251.
17. Douglas, D. H., and Peucker, T. K., 1973, Algorithms for the reduction of the number of points required to represent a line or its caricature. The Canadian Cartographer, 10, 112-122.
18. Dwyer, R., 1989, Higher dimensional Voronoi diagrams in linear expected time. Proceedings 5th ACM Symposium on Computational Geometry (New York: ACM Press), pp. 326-333.
19. Dyn, N., Levin, D., and Rippa, S., 1990, Data dependent triangulations for piecewise linear interpolation. IMA Journal of Numerical Analysis, 10, 137-154.
20. Edelsbrunner, H., 1987, Algorithms in combinatorial geometry (Berlin Heidelberg: Springer- Veriag).
21. Flower, R. J., and Little, J. J., 1979, Automatic extraction of irregular nework digital terrain models. Computer Graphics, 13, 199-207.
22. Gomez, D., and Guzman, A., 1979, Digital model for three-dimensional surface representation. Geo-Processing, 1, 53-70.
23. Gregory, J. A., 1974, Smooth interpolation without twist constraints. In Computer Aided Geometric Design, edited by R. E. Barnhill, R. F. Risenfeld (New York: Academic Press), pp. 71-88.
24. Guibas, L. J., and Stolfi, J., 1983, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, Proceedings 15th A.C.M. Conference on the Theory of Computing (New York: ACM Press), pp. 221-234.
25. Guibas, L. J., Knuth, D. E., and Sharir, M., 1990, Randomized incremental construction of the Delaunay and Voronoi diagrams. Automata, Languages and Programming, Lecture Notes in Computer Science, N.443 (Berlin Heidelberg: Springer-Veriag), pp. 414-431.
26. Hillis, W. D., 1985. The Connection Machine (Cambridge, MA: MIT Press).
27. Hillis, W. D., and Steele, G. L., 1986, Data parallel algorithms. Communications of the ACM, 29, 1170-1183.
28. HUNG, Y., and ROSENFELD, A., 1987, Parallel processing of linear quadtrees on a mesh-connected computer. Technical Report CS-TR-1817, University of Maryland, College Park. MD, U.S.A.
29. Johnson, E. G., and Rosenfeld, A., 1975, Digital detection of peaks, pits, ridges, and ravines. I.E.E.E. Transactions on Systems, Man, and Cybernetics, 5, 472-480.
30. Jones, C. B., Mark Ware, J., and Bundy, G. L., 1992, Multiscale spatial modelling with triangulated surfaces, Proceedings 5th International Symposium on Spatial Data Handling, Charleston, SC, U.S.A., 3-7 August, 1992, 2, edited by P. Bresnahan, E. Corwin, and D. Cowen (Columbia, SC: IGU Commission on GIS), pp. 612-621.
31. Lawson, C. L., 1977, Software for C1 surface interpolation. In Mathematical Software III.edited by J. R. Rice (New York: Academic Press), pp. 161-164.
32. Lee, J., 1989, A drop heuristic conversion method for extracting irregular networks for digital elevation models, Proceedings GIS/LIS’89, Orlando, FL, 1 (Falls Church, VA, U.S.A.: American Congress on Surveying and Mapping, and American Society of Photogrammetry and Remote Sensing; Washington DC: Urban and Regional Information Systems Association, AM/FM International, and Association of American Geographers), pp. 33-39.
33. Lee, J., 1991, Comparison of existing methods for building triangular irregular network models, International Journal of Geographical Information Systems, 5, 267-285.
34. Lee, D. T., and Schachter, B. J., 1980, Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Science, 9, 219-242.
35. Lu, M., 1986, Constructing the Voronoi diagram on a mesh connected computer. In Proceedings I.E.E.E. International Conference on Parallel Processing, St. Charles, IL, U.S.A., August 1986 (New York: I.E.E.E), pp. 806-811.
36. Marr, D., and Hildreth, E., 1980, Theory of edge detection. Proceedings Royal Society of London, B, 207, 187-217.
37. MASPAR SYSTEM OVERVIEW, 1990 (Sunnyvale, CA: MasPar Computer Corporation).
38. Mm, G. G., and Liu, W., 1986, Parallel processing for quadtree problems. Proceedings I.E.E.E. International Conference on Parallel Processing, St. Charles, IL, U.S.A., August 1986 (New York: I.E.E.E.), pp. 140-147.
39. Peuckur, T. K., and Douglas, D. H., 1975, Detection of surface-specific points by local parallel processing of discrete terrain elevation data. Computer Graphics and Image Processing, 4, 375-387.
40. PUPPO, E., DAVIS, L. S., DEMENTHON, D., and TENG, Y. A., 1991, Parallel terrain triangulation using the Connection Machine, Technical Report CS-TR-2693, University of Maryland, College Park MD, U.S.A.
41. Rippa, S., 1990, Minimal roughness property of Delaunay triangulation. Computer Aided Geometric Design, 7, 489-497.
42. Ricart, G., and Agarwala, A. K., 1981, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, 24, 9-17.
43. Sami-r, H., 1990, The Design and Analysis of Spatial Data Structures (Reading, MA: Addison- Wcslcy).
44. Saxena, S., Bhatt, P. C. P., and Prasad, V. C., 1990, Efficient VLSI parallel algorithm for delaunay triangulation on orthogonal tree network in two and three dimensions. I.E.E.E. Transactions on Computers, 39, 400-404.
45. Scarlatos, L. L., 1990, An automatic critical line detector for digital elevation matrices. Proceedings 1990 ASPRS-ACSM Annual Convention, Denver, Co, U.S.A., 2, pp. 43-52.
46. Scarlatos, L. L., and Pavlidis, T., 1990, Hierarchical triangulation using terrain features. Proceedings I.E.E.E. Conference on Visualization, San Francisco, CA, U.S.A. (New York: I.E.E.E.), pp. 168-175.
47. Sjvan, R., and Samet, H., 1992, Algorithms for constructing quadtree surface maps. Proceedings 5th International Symposium on Spatial Data Handling, Charleston, SC, U.S.A., 3-7 August 1992, 2, edited by P. Bresnahan, E, Corwin, and D. Cowen (Columbia, SC: IGU Commission on GIS), pp. 361-370.
48. Southard, D. A., 1991, Piecewise linear surface models from sampled data. In Scientific Visualization of Physical Phenomena, edited by N. M. Patrikalakis (Hong Kong: Springer- Verlag), pp. 667-680.
49. Wang, C. A., and Tsin, Y. H., 1987, An O(log N) time parallel algorithm for triangulating a set of points in the plane. Information Processing Letters, 25, 55-60.
50. Waison, L. T., Laffey, T. J., and Haraijck, R. M., 1985, Topographic classification of digital image intensity surfaces using generalized splines and the discrete cosine transformation. Computer Vision, Graphics and Image Processing, 29, 143-167.