一种高效的数据检索并行Reeb图算法
An Efficient Data Retrieval Parallel Reeb Graph Algorithm
摘要:
定义在定义域上的标量函数的Reeb图给出了该定义域的拓扑有意义的总结。在过去的十年里,Reeb图在几何处理、图像处理、计算机图形学和计算拓扑学中具有重要的意义。在过去的十年中,分析大型数据集的需求有所增加。因此,需要更充分地考虑拓扑计算的并行化。提出了一种在有边界和无边界三角网格上的并行增广Reeb图算法。也就是说,除了我们的并行算法计算的Reeb图,我们描述了一种方法,用于提取原始流形数据的Reeb图结构。我们证明了我们的算法在标准数据集上的运行时间。作为一个应用程序,我们展示了我们的算法可以利用网格分割算法。
英文摘要:
The Reeb graph of a scalar function defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer graphics, and computational topology. The demand for analyzing large data sets has increased in the last decade. Hence the parallelization of topological computations needs to be more fully considered. We propose a parallel augmented Reeb graph algorithm on triangulated meshes with and without a boundary. That is, in addition to our parallel algorithm for computing a Reeb graph, we describe a method for extracting the original manifold data from the Reeb graph structure. We demonstrate the running time of our algorithm on standard datasets. As an application, we show how our algorithm can be utilized in mesh segmentation algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。