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.
Index Terms—3D Web GIS, greedy algorithms, simulated annealing, TSM problem.
All authors are with the Vietnam National University, 334 Nguyen Trai, Thanh Xuan, Hanoi, Viet Nam.
Le Hoang Son is the corresponding author (e-mail: sonlh@ vnu.edu.vn).
Cite: 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.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
