基于动态存储结构的地图贴图算法的改进与实现  

Improvement and Implementation of the Game Map Algorithm Based on Dynamic Storage Structures

作　　者：李艳辉[1] 李军[1] 

机构地区：[1]暨南大学珠海学院计算机系,广东珠海519070

出　　处：《计算机工程与科学》2008年第2期49-50,109,共3页Computer Engineering & Science

基　　金：暨南大学引进人才基金资助项目(04JZKY004)

摘　　要：游戏地图的算法在整个游戏设计中占有重要地位。通过对游戏地图算法的研究,本文对游戏地图贴图算法中的效率问题进行了分析,提出了改进算法,并在VisualC++的环境下实现。通过改进地图图块的存储方法,将地图图块的句柄和地图图块的索引值等数据以二叉排序树结构的方式存储,使动态树可以随游戏的进度动态地往地图上添加图块,结构灵活,速度快。The game map algorithm plays an important part in game designing. Through analyzing the efficiency problem of the game map algorithm,we put forward an improvement algorithm code map, and implement it in the Visual C＋＋ environment. The improvement is the storage method of the map stock, which stores the handles and indexes of the map, using the binary sort tree structure. The improved algorithm can dynamically add image blocks to the map with the progress of the game, and its structure is flexible and features a high speed.

关 键 词：游戏地图 地图贴图算法 存储结构 二叉排序树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]