摘要
提出了一种适用于球面三角形网格的启发式点定位策略.通过构造规则子分网格将原始球面网格区域划分成若干具有子分层次关系的查询小块;在进行查询前,根据查询点p 的位置找到它所在的小块作为搜索区域,从而极大地缩小了查询范围;在查询过程中,根据重心坐标所包含的启发信息,选择一条从初始搜索三角形到目标三角形的最短查询路径.分析表明,启发式点定位策略比传统算法具有更优的运算性能.
A heuristic strategy is presented to solve the point location problem in spherical triangulation mesh. Firstly, a spherical mesh with regular subdivision connectivity is constructed to partition the spherical domain into some small regions. Then the region, which contains the query point p, is found according to the position of p and selected as the search area for locating p. During the point location, the barycentric coordinates are used to extract local heuristic information about the location of p so as to find the shortest path from the start triangle to the target one containing p. In comparison with traditional algorithms, it is found that the heuristic strategy has better time and space performances.
出处
《软件学报》
EI
CSCD
北大核心
2005年第11期1983-1991,共9页
Journal of Software
基金
国家高技术研究发展计划(863)~~
关键词
球面网格
点定位
启发式策略
子分网格
重心坐标
spherical mesh
point location
heuristic strategy
subdivision mesh
barycentric coordinate