ALGORITHMS FOR TETRAHEDRAL NETWORK (TEN) GENERATION
摘要
［1］Borgefors G. Distance transformations in arbitrary dimensions. Computer, Vision, Graphics and Image Processing, 1984(27): 321～345 ［2］Larkin J. An ANSI C program to determine in expected linear time the vertices of the Convex Hull of a set of planar points. Computers & Geosciences, 1991,17 (3): 431～ 443 ［3］Sides E, Hack R. Seminar Report: three-dimensional GIS: future developments. ITC Journal, 1995 (2): 151～ 164 ［4］Fritsch D. Three-dimensional geographical information systems status and prospects. In: International Archives of Photogrammetry and Remote Sensing, Vienna,1996, (B3) :215～278 ［5］Gong J Y,Xia Z G. An integrated data model in three-di-mensional GIS. In: Proceedings of Geoinformatics ' 96Wuhan International Symposium. 1996. 107～120 ［6］Manacedonio G,Pareschi M T. An algorithm for the triangulation of arbitrarily distributed points: applications to volume estimate and terrain fitting. Computer & Geosciences, 1991,17(7) :859～874 ［7］Molenaar M. A topology for 3D vector maps. ITC Journal, 1992(1) :25～33 ［8］Pilouk M, et al. A Tetrahedron-based 3D vector data model for geoinformation In:Advanced Geographic Data Modeling. Netherlands Geodetic Commission, Publications on Geodesy, 1994. 129 ～ 140 ［9］Li Q Q, Li D R. Data structures in three dimensional geographic information system. Journal of Wuhan Technical University of Surveying and Mapping, 1996, 21 (2):128～ 133(in Chinese) ［10］Li Q Q,Li D R. Hybrid data structure based on Octree and Tetrahedron in 3-D GIS. In: International Archives of Photogrammetry and Remote Sensing , Vienna, 1996,31 (B4): 503 ～ 507 ［11］Li Q Q,Li D R. Study on data structure in 3-D GIS.In:Proceedings of Geoinformatics ' 96 Wuhan International Symposium, 1997. 229～ 237