Searcharxiv⌕ Search

arXiv · 2611.20401

Interlocking Tiling of 3D Finite Domains

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuyang Ma, Rulin Chen, Chaewoon Kim, Ying He, Peng Song. 2026-11-16. Interlocking Tiling of 3D Finite Domains. https://searcharxiv.com/abs/2611.20401

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Practical High-Fidelity Novel-View Synthesis of Mounted Lepidoptera

Mounted butterflies are among the most striking objects in natural history collections. However, their beauty is notoriously hard to digitize in 3D: they are small and fragile, with microscopic hairs and vein structures. Capturing them in sufficient detail, therefore, requires a macro lens, which has a very limited Depth of Field (DoF). Moreover, a camera body cannot be maneuvered beneath a pinned specimen to photograph its ventral surface. We introduce an end-to-end pipeline that resolves these challenges, turning such specimens into photorealistic 3D models viewable from every direction. It combines three ingredients: handheld focus stacking for all-in-focus macro capture without a tripod, a non-contact first-surface mirror system that exposes the ventral surface without touching the specimen, and a segmentation-free, mirror-aware 3D Gaussian Splatting extension. We validate the reconstructions and design decisions on nine diverse specimens.

cs.GR↗

SSA-3DGS: Unsupervised Removal of Screen-Space Artifacts for 3D Gaussian Splatting

Novel View Synthesis (NVS) methods, such as 3D Gaussian Splatting (3DGS), rely on the assumption of clean, multi-view consistent, posed input images. Real-world captures can violate this assumption due to \textbf{screen-space artifacts}---static occlusions fixed to the 2D image plane rather than to the 3D world. Common examples include physical sensor defects, environmental obstructions (such as rain or mud on the lens enclosure), capture obstructions (such as a thumb over the camera sensor or a dashboard visible in dashcam footage), and digital overlays (such as watermarks or UI elements). When present, they are erroneously baked into the 3D geometry as ``floaters'' or near-camera artifacts, degrading the quality of novel-view rendering. In this work, we propose \textit{SSA-3DGS}, an unsupervised framework that jointly optimizes a 3D scene and a learnable 2D overlay to recover a clean 3D scene and the corrupting artifacts. By exploiting geometric consensus across views, our method effectively disentangles static artifacts from the 3D scene geometry without supervision or manual input. Across diverse synthetic corruptions and a self-captured real-world dataset, SSA-3DGS improves reconstruction fidelity by up to ${\sim}8$~dB PSNR over 3DGS trained on the same corrupted inputs, while faithfully preserving the corrupting artifact.

cs.GR↗

DOOM-GS: Dynamic Out-of-core Optimization for Massive Gaussian Splatting

Traditional Gaussian Splatting (GS) methods use in-core training, i.e. assuming that GPU memory is large enough to accommodate all the primitives. This assumption breaks down when the primitives exceed the capacity of GPU memory, e.g. GS on large environments. Recent out-of-core training research starts to address this issue, but is limited to static scenes. Unlike static GS, dynamic GS primitives move in space and time, breaking common assumptions held in existing out-of-core research and impose new challenges in memory management and training. To this end, we propose Dynamic Out-of-core Optimization for Massive Gaussian Splatting (DOOM-GS), the first out-of-core optimization method designed specifically for massive-scale dynamic GS. DOOM-GS is equipped with novel memory management strategies that optimize caching for spatio-temporal primitives, and a fast learning method for large numbers of primitives. Due to the lack of suitable datasets for large-scale dynamic GS, we also contribute a new dataset for evaluation. Since there are no directly comparable methods, we adapt several closely related methods for comparison. Through extensive evaluation, we demonstrate the effectiveness of DOOM-GS which now makes it possible to reconstruct city-scale dynamic scenes with high quality on moderate hardware, serving as a foundational tool for diverse future research and applications.

cs.GR↗