局部分类器在待查询数据的邻域内工作,此邻域基于一个局部测度而生成。
The local classifier works in query's neighborhood, and the neighborhood is developed according to a local metric.
八叉树不易表达场景的相邻结点,本文设计了邻域查找算法以进行八叉树中相邻结点的查询。
In view of that the octree is not easy to express the adjacent nodes, we design a neighborhood search algorithms for querying the adjacent nodes.
应用推荐