跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+817新增论文
+672其中 AI 相关
+98已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 12:48 — 2026-11-19 12:48(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
新论文 · v1arXiv:2611.20401

Interlocking Tiling of 3D Finite Domains

Xuyang Ma, Rulin Chen, Chaewoon Kim, Ying He, Peng Song

原文摘要

A K-hedral tiling of a 3D finite domain is a covering of the domain with tiles without gaps or overlaps, where each tile is congruent to one of the K distinct shapes called prototiles. To use 3D K-hedral tilings in practice, they need to satisfy two requirements. First, K should be small to reduce the fabrication cost (e.g., through reusable molds) and simplify the (dis)assembly process. Second, a K-hedral tiling result should be structurally stable, in particular via interlocking, where all the tiles are immobilized by their geometric arrangement, except the key. Since these two requirements are often in conflict, existing approaches always trade one for the other. In this work, we formulate a new tiling problem called interlocking tiling, aiming to generate 3D K-hedral tilings that satisfy the above two requirements simultaneously. Given a 3D finite domain represented as a voxel grid, our goal is to compute a small prototile set whose instances exactly tile the input domain while ensuring that the tiling result forms an interlocking assembly. To solve this challenging problem, we propose a twolevel computational approach that hierarchically decomposes the input domain into interlocking parts (domain-level partitioning) and further partitions each part into interlocking tiles (part-level partitioning). To guide the part-level partitioning, we propose a new graph representation with regular structures to facilitate the generation of tiles with identical shapes while ensuring that they are interlocking. Our approach allows generating interlocking tilings that exactly cover 3D finite domains with diverse shapes while achieving high prototile reuse. We compared our approach with state-of-the-art methods to demonstrate its superiority, and validated the practicality of our interlocking tiling results via fabricating two of them.

cs.GR