基于 位姿空间法提出了可视图法（V-Graph）。该方法将所有障碍物的顶点和机器 人起始点及目标点用直线组合相连，要求机器人和障碍物各顶点之间、目标 点和障碍物各顶点之间...
基于1个网页-相关网页
Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor.
一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。
Segmentation of motion objects based on graph cuts and C-V model;
将两种基于图论的算法图切割与随机游走应用于运动对象的分割。
应用推荐