Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions
Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions
复制标题
分层单纯网格的无指针实现和任意维度的高效邻居查找
DOI：
--
复制
发表时间：
2007
影响因子：
--
通讯作者：
David M. Mount
中科院分区：
文献类型：
--
作者：
F. B. Atalay;David M. Mount
基于Maubach提出的二分法，我们描述了一种层次规则单纯网格的无指针表示。我们引入了一个新的标签计划，称为LPT码，它唯一地编码的层次结构的每个单纯形的几何形状，我们提出的规则来计算一个给定的单纯形的邻居eciently通过使用这些代码。此外，我们展示了如何遍历相关的树，以及如何回答点的位置和插值查询。我们的系统可以在任意维度上工作。
We describe a pointerless representation of hierarchical regular simplicial meshes, based on a bisection approach proposed by Maubach. We introduce a new labeling scheme, called an LPT code, which uniquely encodes the geometry of each simplex of the hierarchy, and we present rules to compute the neighbors of a given simplex ecien tly through the use of these codes. In addition, we show how to traverse the associated tree and how to answer point location and interpolation queries. Our system works in arbitrary dimensions.