arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1704.00142cs.CG
收藏

细胞复合体的规则排列

Regularized arrangements of cellular complexes

Alberto Paoluzzi, Vadim Shapiro, Antonio DiCarlo

摘要:

在本文中,我们提出了一种新的算法,结合两个或更多的细胞复合物,提供了一个最小的碎片的细胞所产生的复合物。我们在这里介绍的想法产生的细胞复合物的集合,产生的嵌入空间的细胞分解的安排。执行此计算的算法称为复数的\emph{Merge}。2D中的线段和3D中的多边形的布置是特殊情况,以及闭合三角形化表面或网格模型的组合。该算法有几个重要的应用,包括布尔运算和其他集合操作在大型几何模型,提取实体模型的生物医学结构在细胞尺度上,详细的几何建模的建筑物,三维网格的组合,和修复的图形模型。该算法是有效地实现使用线性代数表示(LAR)的论点复杂,即,基于$d$ -cell的二进制特征矩阵的稀疏表示,非常适合在上一代加速器和GPGPU应用中实现。

英文摘要:

In this paper we propose a novel algorithm to combine two or more cellular complexes, providing a minimal fragmentation of the cells of the resulting complex. We introduce here the idea of arrangement generated by a collection of cellular complexes, producing a cellular decomposition of the embedding space. The algorithm that executes this computation is called \emph{Merge} of complexes. The arrangements of line segments in 2D and polygons in 3D are special cases, as well as the combination of closed triangulated surfaces or meshed models. This algorithm has several important applications, including Boolean and other set operations over large geometric models, the extraction of solid models of biomedical structures at the cellular scale, the detailed geometric modeling of buildings, the combination of 3D meshes, and the repair of graphical models. The algorithm is efficiently implemented using the Linear Algebraic Representation (LAR) of argument complexes, i.e., on sparse representation of binary characteristic matrices of $d$-cell bases, well-suited for implementation in last generation accelerators and GPGPU applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑