Advanced Interlocking Joints for Additive Manufacturing

The paradigm of additive manufacturing (AM) has shifted from simple rapid prototyping to the production of functional, end-use assemblies. However, the physical constraints of build volumes and the inherent material limitations of homogeneous prints often necessitate the decomposition of complex geometries into constituent parts. The challenge lies in ensuring these parts can be reassembled into a structurally sound, kinematically stable whole without relying on external fasteners or adhesives. This report provides an exhaustive investigation into the mathematical frameworks and computational geometry algorithms required to achieve automated mesh partitioning with interlocking joints, specifically focusing on kinematic constraint analysis, joint topology generation, geometric dimensioning and tolerancing (GD&T) through Minkowski sums, stress mitigation, and graph-based assembly sequencing.

Kinematic Constraint Analysis for 3D Interlocking Assemblies

The fundamental objective of any interlocking assembly is to achieve a state of topological interlocking, where the constituent blocks are immobilized purely by their geometric relationships and a minimal set of external constraints, often referred to as the frame.1 To analyze such systems, a robust mathematical treatment of kinematic degrees of freedom (DOF) is required.

Mathematical Definition of Degrees of Freedom

In three-dimensional Euclidean space, a single unconstrained rigid body possesses six degrees of freedom: three translational components along the and axes, and three rotational components about those axes.3 When multiple bodies are joined, the system’s mobility is governed by the constraints imposed at each interface. The Kutzbach-Gruebler criterion provides a macroscopic check for the mobility of a mechanism or structure:

Where is the mobility (or total DOF), is the number of links (including the fixed base), is the number of joints, and is the number of constraints imposed by the -th joint.5 For a structure to be statically determinate and interlocked, must effectively reach zero or become negative upon the insertion of a final “key” part.6

The Rigidity Matrix and Infinitesimal Motions

While Gruebler’s equation provides a count of constraints, it does not account for the geometric arrangement of those constraints. A more rigorous approach involves the rigidity matrix, which encodes the first-order constraints on the velocities of the vertices.8 For a framework of vertices in dimensions, the rigidity matrix is an matrix where is the number of edges (or constraints). The entries of are derived from the derivative of the rigidity map , which assigns squared lengths to the edges 9:

The null space of represents the infinitesimal flexes or motions of the structure. In a three-dimensional assembly, if the rank of the rigidity matrix is , the assembly is considered infinitesimally rigid, meaning the only allowed motions are the six trivial rigid body motions (three translations and three rotations).8 In the context of interlocking blocks, the “frame” blocks are pinned, reducing the trivial motions to zero and allowing the designer to verify that no non-trivial infinitesimal motion exists for any internal block.1

Classification of Kinematic Joints in 3D Assemblies

To automate the partitioning of a mesh, the algorithm must select joint types that appropriately restrict the DOF based on the intended function of the assembly.

 

Joint Type	DOF	Constraints	Motion Allowed
Fixed (F)	0	6	None 5
Revolute (R)	1	5	Rotation about one axis 4
Prismatic (P)	1	5	Translation along one axis 4
Cylindrical (C)	2	4	Translation and Rotation about same axis 5
Spherical (S)	3	3	Rotation about three axes 4
Planar	3	3	Two translations and one rotation 3

In interlocking assemblies, joints like the dovetail are particularly effective because they restrict five DOF, allowing only a single translational path for assembly and disassembly.6 The mathematical verification of such joints involves checking the normal vectors at the contact points. Each point contact eliminates exactly one DOF by preventing relative motion along the contact normal.3

Algorithms for Generating Interlocking Joint Topologies

The generation of joints such as dovetail, lap, and puzzle-piece structures on arbitrary surfaces requires a transition from traditional CAD primitives to more flexible computational geometry representations.

Voxelization-Based Joint Synthesis

One of the most robust frameworks for automated partitioning involves voxelization. By discretizing a 3D model into a uniform grid of voxels, the problem of complex surface intersections is reduced to a discrete blocking problem.11 The algorithm extracts interlocking puzzle pieces iteratively, ensuring that each piece is constrained by its neighbors.

The “voxel blocking mechanics” logic relies on the local interlocking requirement: every three consecutive intermediate pieces must be locally interlocked.11 This prevents any single sub-assembly from falling apart. During voxelization, ray-casting is used to classify points as interior or exterior, and a local shape analysis is performed to guide the construction of joint interfaces that avoid “voxel fragmentation”—the creation of thin, unprintable features.11

Group Theory and Non-Blocking Twisty Joints

For assemblies that require rotational interlocking (such as twisty puzzles), the generation algorithm utilizes the finite rotation groups of .14 The mathematical core of this method is the alignment of finite symmetry groups (tetrahedral, octahedral, or icosahedral) to a set of user-defined rotation axes.

1. Axis Selection: The user specifies a set of rotation axes on an arbitrary shape.14
2. Symmetry Alignment: The algorithm finds a rotation matrix that minimizes the distance between user axes and the axes of a known finite subgroup.14
3. Jaap’s Sphere Integration: A core sphere is fitted inside the 3D model. The interlocking geometry (tongues and grooves) is generated using constructive solid geometry (CSG) operations based on these rotation axes and the core sphere.14
4. Collision Resolution: To prevent interference in non-convex shapes, the algorithm projects potential 3D moves onto 2D half-planes. If collisions are detected, Laplacian-based mesh deformation is applied to “shrink” the colliding regions.14

Conformal Joint Generation on Non-Planar Surfaces

When partitioning a mesh along a curved surface, joints must be “wrapped” conformally. A common mathematical approach is to project a 2D joint trajectory onto a triangle-tessellated surface.15

The algorithm treats the joint path as a sequence of ordered points. For each point , a projection vector is defined. The intersection of the ray with the triangles of the STL model is calculated using the plane equations of the facets:

Where is the facet normal.16 By calculating the surface normal at each intersection point, the algorithm can orient the joint profile (e.g., the “neck” and “tail” of a dovetail) to be perpendicular to the local curvature, ensuring optimal mechanical interlocking and minimizing the stair-stepping effect common in planar slicing.16

Mathematical Modeling of GD&T and Clearances via Minkowski Sums

Geometric Dimensioning and Tolerancing (GD&T) is critical for ensuring that 3D-printed parts fit together. In interlocking interfaces, the “clearance” is the gap between mating surfaces that accounts for printer inaccuracies, material shrinkage, and the need for assembly motion.

The Minkowski Sum Framework

The Minkowski sum of two sets and is the set of all point-wise sums of their elements 18:

In tolerance modeling, if is the nominal geometry and is a ball of radius (denoted ), the Minkowski sum represents a dilated version of the part, while the Minkowski difference (or erosion) represents a shrunken version.18 For a joint to have a clearance of , the male component is shrunken by and the female cavity is expanded by using these offset operations.

Offsetting and Convolution

For non-planar surfaces, the computation of the Minkowski sum is equivalent to calculating the boundary of the envelope formed when one shape is translated around another.18 The boundary is contained in the envelope of moved by translations defined by vectors . If both and are piecewise smooth, a point lies on the envelope if and only if the tangent planes at and are parallel.18

For complex 3D meshes, this is often implemented via a “marching method” in the distance field of the envelope.18 This discretized implicit representation allows for robust handling of global self-intersections, which are common in internal joint features.18

Process-Specific Clearance Parameters

The choice of clearance depends heavily on the AM process. Powder-bed fusion processes (SLS, MJF) require larger clearances to allow for powder escape and to prevent the fusing of adjacent surfaces during the thermal build process.21

 

Process	Typical Tolerance (mm)	Min. Feature (mm)	Assembly Clearance (mm)	Moving Joint Gap (mm)
SLA	–		–	23
SLS				21
MJF			–	21
FDM	–		–	24

MJF (HP Multi Jet Fusion) typically requires a minimum clearance of mm for post-assembly to avoid fusing, though mm can be used for very snug fits.22 For moving joints where surfaces slide against each other, mm is the industry standard to ensure mobility after the removal of unsintered powder.21 In SLA, the clearance can be as low as mm due to the high resolution of the resin-based process, although parts may swell slightly due to resin curing, necessitating careful calibration.24

Stress Concentration and Filleted Transitions

Partitioning a monolithic object into parts introduces structural vulnerabilities. Interlocking joints, particularly those with re-entrant features like dovetails, act as “stress risers” that concentrate mechanical load.

Stress Concentration Factors (SCF)

The stress concentration factor is the ratio of the peak stress at a discontinuity to the nominal stress in the cross-section.27 In interlocking joints, sharp internal corners (notches) significantly increase this value:

For 3D printed parts, is influenced by the layer orientation. If the stress riser aligns with the inter-layer boundaries, the risk of delamination increases.29 Materials like PLA exhibit much higher sensitivity to stress concentrations compared to more compliant materials like TPU or NinjaFlex.29

Filleting Algorithms via Signed Distance Fields (SDF)

The traditional method to reduce stress concentration is the addition of fillets—rounded transitions at sharp corners.28 In automated mesh partitioning, simply adding a radius is often insufficient for complex, non-planar junctions. Instead, SDF-based filleting is employed.

An SDF maps every point in space to the distance to the nearest surface, with a negative sign for points inside the volume.30 The “Double-Offset” algorithm provides a seamless filleting method:

1. Dilation: The part is expanded by radius ().
2. Erosion: The resulting shape is then shrunken by the same radius ().30

This process effectively “fills in” sharp internal corners with a radius while preserving the overall geometry. Mathematically, for a vertex , the point on the offset surface lies on a sphere of radius centered at .32 By using Dual-Contouring to reconstruct the mesh from the SDF, the algorithm ensures that the new joint surfaces are manifold and watertight.30

Optimized Spline Profiles

Research into fillet weld joints has shown that circular fillets are often sub-optimal. Using a “Spline Weld Model” allows for a better approximation of the real stress distribution.27 Parametric formulas based on spline curves can reduce the error in SCF prediction to under 5%.27 Furthermore, elliptical fillets with an ratio of approximately 1.25 have been shown to reduce stress concentrations by nearly 10% compared to standard circular fillets in keyway-like geometries.34

Graph-Based Assembly Sequencing and Interference Detection

Ensuring that partitioned parts can be physically assembled is a non-trivial challenge, especially for interlocking puzzles where parts must slide into place in a specific order.

Precedence Graphs and Liaison Matrices

An assembly is represented as a directed graph , where represents the components, represent geometric contacts (liaisons), and represents the assembly precedence constraints.35 A liaison exists between two parts if one part constrains the freedom of motion of the other by direct contact.35

The assembly sequence planning (ASP) process typically follows the “Assembly-by-Disassembly” (AbD) logic, which assumes that a valid assembly sequence is the reverse of a collision-free disassembly sequence.37

The Moving Wedge (MW) Matrix

The key to verifying a sliding assembly is the Moving Wedge (MW) matrix, also known as the interference-free matrix.37 The MW matrix represents the feasibility of moving part relative to part in a given direction .

For every pair and each of the six global axes :

• if part can be moved in direction without colliding with .
• if part acts as an obstacle.

The matrix is extracted by a dynamic collision check where parts are moved step-by-step along each axis. The total movement distance is determined by the bounding boxes of the entire assembly.37 To ensure a subassembly can be joined to , the algorithm must find at least one direction where the intersection of MW values for all pairs of parts between and is 1.37

Optimization Strategies

Due to the combinatorial explosion of potential sequences, algorithms must employ heuristics and search strategies:

1. AND/OR Graphs (AOG): These graphs store all feasible subassembly combinations. A node in an AOG represents a stable subassembly, and an edge represents a feasible assembly operation.37
2. Reinforcement Learning: Graph Neural Networks (GNNs) can be trained to predict feasible assembly sequences by leveraging object manipulation actions in physics-based simulations.38
3. Collision Analysis via Minkowski Sums: Some systems sample oblique insertion directions and use Minkowski-sum collision maps to build blocking graphs, automatically extracting precedence constraints between parts.39

Synthesis and Structural Considerations for Partitioned Meshes

The integration of these mathematical frameworks leads to a unified approach for automated mesh partitioning. The initial 3D model is analyzed via skeletonization or voxelization to determine optimal cut surfaces that satisfy the minima rule and maximize structural integrity.40 Joint profiles are then generated conformally along these surfaces, with kinematic constraints verified to ensure the final assembly is rigid.6

Mesh Improvement and Refinement

To ensure the quality of the resulting parts, post-partitioning mesh improvement is necessary. This involves moving nodes on curved joint surfaces to maintain domain geometry and preserve volume.42 Laplacian smoothing is applied to the internal elements of the partitioned mesh, but it must be constrained by log-barrier functions to prevent the collapse of small joint features.42

Thermal and Mechanical Stability in MJF/SLS

When designing for powder-bed processes, specific geometric rules must be followed to prevent failure during cooling.

 

Feature	Design Rule for MJF/SLS	Reasoning
Wall Thickness	Min. 1.0 mm (supported/unsupported)	To prevent deformation during alcohol cleaning and post-processing.25
Escape Holes	Min. 2.5 mm diameter	To allow removal of unsintered powder/resin from hollow joints.25
Large Flat Areas	Replace with lattices or ribs	To reduce thermal stress and warping from uneven cooling.22
Cantilevers	Aspect ratio if mm	To prevent snapping or warping during the print cycle.22

Advanced Perspectives: 4D Printing and Multi-Material Transitions

Future directions in mesh partitioning involve 4D printing, where interlocking mechanisms are used to print dissimilar materials that are later assembled to achieve a desired shape change upon stimulation.13 These “active” interlocking structures exhibit better mechanical performance and actuation response than monolithic multi-material structures.13 Gradient transitions between rigid and soft materials (Functionally Graded Materials) are also being investigated to mitigate delamination at the interfaces of hybrid exoskeletons.44

In conclusion, the automated partitioning of 3D meshes with interlocking joints represents a convergence of computational geometry, mechanical engineering, and robotics. By rigorously applying kinematic constraint analysis, generating conformal joint topologies, modeling GD&T through Minkowski sums, and optimizing assembly sequences via graph theory, we can produce complex, large-scale structures that are structurally sound, easy to assemble, and optimized for the unique constraints of additive manufacturing.

Works cited

1. Mathematical Foundations of Interlocking Assemblies – arXiv, accessed April 6, 2026, https://arxiv.org/html/2405.17644v1
2. (PDF) Mathematical Foundations of Interlocking Assemblies – ResearchGate, accessed April 6, 2026, https://www.researchgate.net/publication/380934872_Mathematical_Foundations_of_Interlocking_Assemblies
3. The Principle of Kinematic Constraint – Practical Precision, accessed April 6, 2026, https://practicalprecision.com/kinematic-constraint/
4. Chapter 4. Basic Kinematics of Constrained Rigid Bodies – Carnegie Mellon University, accessed April 6, 2026, https://www.cs.cmu.edu/~rapidproto/mechanisms/chpt4.html
5. Lesson 1: Kinematic Joints and Constraint Analysis – SiliconWit, accessed April 6, 2026, https://siliconwit.com/education/planar-mechanics/kinematic-joints-constraint-analysis/
6. Interlocking block assembly – Parasol Lab @ UIUC, accessed April 6, 2026, https://parasollab.web.illinois.edu/events/wafr2018/ppr_files/WAFR_2018_paper_84.pdf
7. Kinematic and Quasi-Kinematic Constraints: What They Are & How They Work, accessed April 6, 2026, https://wp.optics.arizona.edu/optomech/wp-content/uploads/sites/53/2016/10/FellowesTutorial1.pdf
8. Geometric rigidity – Wikipedia, accessed April 6, 2026, https://en.wikipedia.org/wiki/Geometric_rigidity
9. The basics of rigidity – Cornell Mathematics, accessed April 6, 2026, https://pi.math.cornell.edu/~connelly/BasicsI.BasicsII.pdf
10. Projective background of the infinitesimal rigidity of frameworks – arXiv, accessed April 6, 2026, https://arxiv.org/pdf/0804.2694
11. Printing 3D objects with interlocking parts – Computational Design Lab, accessed April 6, 2026, https://sutd-cgl.github.io/supp/Publication/papers/2015-GMP-InterlockObject.pdf
12. Printing 3D objects with interlocking parts – Computational Design Lab, accessed April 6, 2026, https://sutd-cgl.github.io/supp/Publication/projects/2015-GMP-Interlock/download/2015-GMP-InterlockObject.pdf
13. Printing 3D objects with interlocking parts – ResearchGate, accessed April 6, 2026, https://www.researchgate.net/publication/275058983_Printing_3D_objects_with_interlocking_parts
14. Computational Design of Twisty Joints and Puzzles – Columbia …, accessed April 6, 2026, https://www.cs.columbia.edu/cg/twisty/twisty-lowres.pdf
15. Algorithm for the Conformal 3D Printing on Non-Planar Tessellated Surfaces: Applicability in Patterns and Lattices – ResearchGate, accessed April 6, 2026, https://www.researchgate.net/publication/353930574_Algorithm_for_the_Conformal_3D_Printing_on_Non-Planar_Tessellated_Surfaces_Applicability_in_Patterns_and_Lattices
16. Algorithm for the Conformal 3D Printing on Non-Planar Tessellated Surfaces: Applicability in Patterns and Lattices – MDPI, accessed April 6, 2026, https://www.mdpi.com/2076-3417/11/16/7509
17. Non-planar slicing algorithm based on Geodesic field on Tetrahedral mesh for AM fabrication | Request PDF – ResearchGate, accessed April 6, 2026, https://www.researchgate.net/publication/384786495_Non-planar_slicing_algorithm_based_on_Geodesic_field_on_Tetrahedral_mesh_for_AM_fabrication
18. Minkowski sum boundary surfaces of 3D-objects – and Geometry, accessed April 6, 2026, https://www.geometrie.tuwien.ac.at/geom/ig/peternell/mink_sum.pdf
19. CGAL 6.1.1 – 2D Minkowski Sums: User Manual, accessed April 6, 2026, https://doc.cgal.org/latest/Minkowski_sum_2/index.html
20. Offsets, sweeps, and Minkowski sums, accessed April 6, 2026, http://3map.snu.ac.kr/mskim/ftp/si-offset.pdf
21. SLS Vs. MJF 3D Printing Technology – JLC3DP, accessed April 6, 2026, https://jlc3dp.com/blog/sls-vs-mjf
22. MJF 3D Printing Design Tips: 9 Best Practices – Xometry Pro, accessed April 6, 2026, https://xometry.pro/en/articles/mjf-design-guidelines/
23. 3D Printing for Engineers: Complete Guide (2026) – MakerStage, accessed April 6, 2026, https://www.makerstage.com/resources/3d-printing-guide
24. Tolerances for 3D printing: accuracy, clearance & design tips – Sinterit – Professional SLS 3D Printers & Accessories, accessed April 6, 2026, https://sinterit.com/3d-printing-guide/design-for-3d-printing/tolerances-3d-printing/
25. 3D Printing Design Guideline – JLC3DP, accessed April 6, 2026, https://jlc3dp.com/help/article/3D-Printing-Design-Guideline
26. 3D Printing Tolerances Explained: What Accuracy Can You Expect? | 3D On Demand Blog, accessed April 6, 2026, https://www.3d-demand.com/blog/3d-printing-tolerances-explained
27. Parametric Formula for Stress Concentration Factor of Fillet Weld Joints with Spline Bead Profile – MDPI, accessed April 6, 2026, https://www.mdpi.com/1996-1944/13/20/4639
28. 2-4: Stress Concentration Caused by Sudden Change in Form – NJIT, accessed April 6, 2026, https://web.njit.edu/~sengupta/met%20301/Stress%20Concentration.pdf
29. 3D Printing Design Tips – Part 1: Stress Concentrations, accessed April 6, 2026, https://www.printedsolid.com/blogs/news/37036739-3d-printing-design-tips-part-1-stress-concentrations
30. Mesh to SDF (Signed Distance Field) Library for Python & C++ – MeshLib SDK, accessed April 6, 2026, https://meshlib.io/feature/mesh-to-sdf/
31. Computing Signed Distances (SDFs) to Meshes – Point Cloud Utils, accessed April 6, 2026, https://fwilliams.info/point-cloud-utils/sections/mesh_sdf/
32. (PDF) Filleting and Rounding Using a Point-Based Method, accessed April 6, 2026, https://www.researchgate.net/publication/239548589_Filleting_and_Rounding_Using_a_Point-Based_Method
33. Parametric Formula for Stress Concentration Factor of Fillet Weld Joints with Spline Bead Profile – PMC, accessed April 6, 2026, https://pmc.ncbi.nlm.nih.gov/articles/PMC7603135/
34. analysis of the influence of fillet geometry on stress concentration in keyway by the finite element – Even3, accessed April 6, 2026, https://static.even3.com/anais/763028.pdf?v=638963551038629433
35. (PDF) Knowledge-Based Approach to Assembly Sequence Planning – ResearchGate, accessed April 6, 2026, https://www.researchgate.net/publication/274988377_Knowledge-Based_Approach_to_Assembly_Sequence_Planning
36. Graph Database and Matrix-Based Intelligent Generation of the Assembly Sequence of Prefabricated Building Components – MDPI, accessed April 6, 2026, https://www.mdpi.com/2076-3417/13/17/9834
37. CAD-based AND/OR Graph Generation Algorithms in (Dis)assembly …, accessed April 6, 2026, https://d-nb.info/1253780021/34
38. Subassembly to Full Assembly: Effective Assembly Sequence Planning through Graph-based Reinforcement Learning – arXiv, accessed April 6, 2026, https://arxiv.org/html/2409.13620v1
39. An Ontological Approach for Generating Precedence Matrices of Assemblies Directly from CAD Files – CEUR-WS.org, accessed April 6, 2026, https://ceur-ws.org/Vol-4176/fomi-5.pdf
40. Models partition for 3D printing objects using skeleton – Emerald Insight, accessed April 6, 2026, https://www.emerald.com/rpj/article/23/1/54/368265/Models-partition-for-3D-printing-objects-using
41. Interactive Partitioning of 3D Models into Printable Parts | Semantic Scholar, accessed April 6, 2026, https://www.semanticscholar.org/paper/Interactive-Partitioning-of-3D-Models-into-Parts-Jadoon-Wu/c258e6ca59bd882391bb45a83f5573f0d655454e
42. [1307.3404] Mesh Improvement Methodology for 3D Volumes with non-Planar Surfaces, accessed April 6, 2026, https://arxiv.org/abs/1307.3404
43. (PDF) Mesh Improvement Methodology for 3D Volumes with non-Planar Surfaces, accessed April 6, 2026, https://www.researchgate.net/publication/249011887_Mesh_Improvement_Methodology_for_3D_Volumes_with_non-Planar_Surfaces
44. From Shore-A 85 to Shore-D 70: Multimaterial Transitions in 3D-Printed Exoskeleton – MDPI, accessed April 6, 2026, https://www.mdpi.com/2079-9292/14/16/3316