Earticle

초록

영어

This article is dedicated to the purpose of introducing the simplification of the triangular-network's multi-resolution, as well as the concept of grid, trigonometry, topographic goading, triangular-sector, etc. In addition, this article proposes a new algorithm that combines the layer-segmentation of the multi-resolution model and the binary space partitioning (BSP) tree, in which the layer-segmentation of the triangular belt is capable of achieving a better result in terms of dissolving the model, therefore creating the foundation of the BSP tree's structural setup. The purpose of finding BSP tree, on the other hand, is to identify sensitive data from the non-sensitive one, so that whatever data that is contacted with the viewpoint can be fully transferred and displayed. Speaking of the designing part of the database, this algorithm combines the latest techniques such as the XML.ADO.NET, and thereby capable of designing transfer plans accordingly.

목차

Abstract
 1. Introduction
 2. The Concept of Triangular Grid
 3. Algorithm Research
  3.1. The Coding and Multi-layer Model of the Bi-orthogonal Wavelet
  3.2. Topographic Coding
  3.3. The Triangular Belt
  3.4. The General Triangular Belt
  3.5. The Pent-layer Segmentation
  3.6. BSP Tree
  3.7. Brief on the Visual-relevant Transfer Algorithm
 4. The Test and its Result
 5. Conclusion
 References

키워드

저자

• Jun Tang [ Department of Communication Engineering, Xiamen University of Technology, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605