IEEE Trans Pattern Anal Mach Intell. 2011 Dec;33(12):2538-44. doi: 10.1109/TPAMI.2011.116. Epub 2011 Jun 9.
A new visibility graph-based algorithm is presented for computing the inner distances of a 3D shape represented by a volumetric model. The inner distance is defined as the length of the shortest path between landmark points within the shape. The inner distance is robust to articulation and can reflect the deformation of a shape structure well without an explicit decomposition. Our method is based on the visibility graph approach. To check the visibility between pairwise points, we propose a novel, fast, and robust visibility checking algorithm based on a clustering technique which operates directly on the volumetric model without any surface reconstruction procedure, where an octree is used for accelerating the computation. The inner distance can be used as a replacement for other distance measures to build a more accurate description for complex shapes, especially for those with articulated parts. The binary executable program for the Windows platform is available from https://engineering.purdue.edu/PRECISE/VMID.
提出了一种基于可见性图的新算法，用于计算体积模型表示的 3D 形状的内部距离。内部距离定义为形状内地标点之间最短路径的长度。内部距离对关节具有鲁棒性，无需显式分解即可很好地反映形状结构的变形。我们的方法基于可见性图方法。为了检查成对点之间的可见性，我们提出了一种新颖、快速和鲁棒的可见性检查算法，该算法基于聚类技术，直接在体积模型上运行，无需任何表面重建过程，其中使用八叉树加速计算。内部距离可以用作其他距离度量的替代方法，以构建更准确的复杂形状描述，特别是对于具有关节部分的形状。适用于 Windows 平台的二进制可执行程序可从 https://engineering.purdue.edu/PRECISE/VMID 获得。
