In real-time update algorithm of nearest neighbor query of moving objects, safe area is always an irregular convex polygon which is difficult to solve.
在移动对象最近邻查询实时更新算法中，安全区一般是难以求解的不规则凸多边形。
参考来源 - 移动对象最近邻查询实时更新算法·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
In this paper, we treat the convex polygon domain as locus of points and give its equation.
在传统解析几何中，平面区域未被作为点的轨迹来看待，因此没有研究平面区域的方程问题。
The convex polygon is constructed by vector product in order to solve the straightness error.
为求解直线度误差，采用矢量积构造凸多边形。
An attempt has been made to compare different algorithms which are based on the methods of 0.618, standard rotation and convex polygon.
对0.618法、基准旋转法和凸多边形法等不同算法的比较进行了尝试。
应用推荐