Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point containment testing. No global topological information at all is explicitly needed (although the complete global topology could be recovered). The neighborhood of the vertex means the directions of the edges and faces on it but not their extents. These vertex-based formulae are dual to the usual formulae that use the faces. They have been implemented and the stability against inconsistent data tested. Alternative data structures and formulae for polyhedron calculation are important since special cases are a function partly of the data structure, and because different methods have different numerical accuracy and error detection properties.
仅给出顶点的位置和邻域的集合即可轻松计算多面体的属性。可能的属性包括体积,表面积和点容纳测试。完全不需要全局拓扑信息(尽管可以恢复完整的全局拓扑)。顶点的邻域是指边缘和面在其上的方向,而不是其范围。这些基于顶点的公式与使用面的常规公式是双重的。它们已经实现,并且对不一致数据的稳定性进行了测试。多面体计算的替代数据结构和公式非常重要,因为特殊情况是数据结构的部分功能,并且由于不同的方法具有不同的数值精度和错误检测特性。 P>
机译:通过轮廓邻域中的顶点重定位来优化多边形逼近
机译:多边形顶点极值和多边形分解
机译:相同规则多边形的顶点到顶点的包装
机译:凸多边形(点对多边形)中鞋带算法的一种新方法(超顶点)和推广
机译:闪锌矿和纤锌矿硫化锌(ZnS)的准确,计算的电子,输运和结构特性。
机译:隔离性质和重装从口腔端粒酶携带多边形阵列的外鞘。
机译:多边形顶点极值和多边形分解
机译:量子力学系统路径空间的多边形路径近似:多边形路径的性质