International Journal of Computer Theory and Engineering

Editor-In-Chief: Prof. Mehmet Sahinoglu
Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJIET 2011 Vol.3(5): 590-597
doi: 10.7763/IJCTE.2011.V3.376

Some Extensions of Terrain Splitting and Mapping Problem

Le Hoang Son , Pham Huy Thong , Truong Thi Hanh Phuc , Nguyen Dinh Hoa , Nguyen Thi Hong Minh

  • Vietnam National University, 334 Nguyen Trai, Thanh Xuan, Hanoi, Viet Nam.

Abstract

Terrain Splitting and Mapping (TSM) problem was originally proposed by the authors in [12]. It was designed to increase the terrain display and query capabilities from a large terrain dataset. This problem is very important in 3D Web GIS and has been being considered as one of some main focuses in the following year. Indeed, the aim of this note is presenting some extensions of the TSM problem. Then, two novel algorithms based on Simulated Annealing and Greedy algorithms are described. The Experiment section in this paper reveals some interesting results and promises to efficiently support to the original problem.

Keywords

  • 3D Web GIS
  • greedy algorithms
  • simulated annealing
  • TSM problem
376-G1087

How to Cite

Copied

Le Hoang Son, Pham Huy Thong, Truong Thi Hanh Phuc, Nguyen Dinh Hoa, and Nguyen Thi Hong Minh, "Some Extensions of Terrain Splitting and Mapping Problem," International Journal of Computer Theory and Engineering, vol. 3, no. 5, pp. 590-597, 2011. https://doi.org/10.7763/IJCTE.2011.V3.376

Copyright & License

Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu