The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

A Digital Terrain Simplification Algorithm with a Partitioning Method

구역화를 이용한 디지털 격자지형데이터의 단순화 알고리즘

  • Gang, Yun-Sik (Dept.of Computer Science, Graduate School of Yonsei University) ;
  • Park, U-Chan (Dept.of Computer Science, Graduate School of Yonsei University) ;
  • Yang, Seong-Bong (Dept.of Computer Science, Yonsei University)
  • 강윤식 (연세대학교 대학원 컴퓨터과학과) ;
  • 박우찬 (연세대학교 대학원 컴퓨터과학과) ;
  • 양성봉 (연세대학교 컴퓨터과학과)
  • Published : 2000.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in [1,4,5]. Our algorithm partitions a terrain height data into rectangular blocks with the same size ad simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles withing each current block for adding a point into the triangulation. Therefore, the algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that partitioning method runs from 4 to more than 20 times faster, and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in th simplified terrain.

Keywords

References

  1. L. D. Floriani, B. Falcidieno, and C. Pienovi, 'A Delaunay-based method for surface approximation,' Eurographics '83, pp.33-350, 1983
  2. L. D. Floriani, B. Falcidieno, G. Nagy, and C. Pienovi, 'A hierarchical structure for surface approximation,' Computers and Graphics, Vol.8, No.2, pp.183-193, 1984 https://doi.org/10.1016/0097-8493(84)90054-2
  3. L. D. Floriani. 'Surface representations based on triangular grids,' The Visual Computer, Vol.3, pp. 27-50, 1987 https://doi.org/10.1007/BF02153649
  4. L. D. Floriani, 'A pyramidal data structure for triangle-based surface description,' IEEE Computer Graphics and Application, Vol.9, No.2, pp.67-78, March 1989 https://doi.org/10.1109/38.19053
  5. M. Garland and P. S. Heckbert, 'Fast polygonal approximation of terrains and height fields,' Technical report, CS Dept., Carnegie Mellon D., Sept, 1995. CMUCS-95-181, http://www.cs.cmu.edu/~garland/scape
  6. K. Anjyo, Y. Usami, T. Kurihara, 'A Simple Method for Extracting the Natural Beauty of Hair,' SIGGRAPH '92, Vol.26, No.2, pp.111-120, July 1992 https://doi.org/10.1145/142920.134021
  7. P. S. Heckbert, 'Survey of texture mapping,' IEEE Transaction on Computer Graphics and Applications, pp.56-57, Nov. 1986 https://doi.org/10.1109/MCG.1986.276672
  8. M. Chow. 'Optimized geometry compression for realtime rendering,' IEEE Visualization '97, pp. 347-354, Oct. 1997 https://doi.org/10.1109/VISUAL.1997.663902
  9. N. Greene, 'Environment mapping and other applications of world projections,' IEEE Computer Graphics and Applications, Vol.6, No.11, pp.21- 29, 1986 https://doi.org/10.1109/MCG.1986.276658
  10. S. L. Tanimoto and T. Pavlidis, 'A hierarchical data structure for picture processing,' Computer Graphics and Image Preocessing, Vol.4, No.2, pp.104-119, June 1975
  11. L. Williams, 'Pyramidal parametrics,' Computer Graphics(SIGGRAPH'83 Proc), Vol.17, No.3, pp. 1-11, July 1983 https://doi.org/10.1145/800059.801126
  12. D. Gomez and A. Guzman, 'Digital model for threedimensional surface representation,' GeoProcessing, Vol.1, pp.53-70, 1979
  13. H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990