Dr. KID: Direct Remeshing and K-set Isometric Decomposition for Scalable Physicalization of Organic Shapes

04/06/2023
by   Dawar Khan, et al.
0

Dr. KID is an algorithm that uses isometric decomposition for the physicalization of potato-shaped organic models in a puzzle fashion. The algorithm begins with creating a simple, regular triangular surface mesh of organic shapes, followed by iterative k-means clustering and remeshing. For clustering, we need similarity between triangles (segments) which is defined as a distance function. The distance function maps each triangle's shape to a single point in the virtual 3D space. Thus, the distance between the triangles indicates their degree of dissimilarity. K-means clustering uses this distance and sorts of segments into k classes. After this, remeshing is applied to minimize the distance between triangles within the same cluster by making their shapes identical. Clustering and remeshing are repeated until the distance between triangles in the same cluster reaches an acceptable threshold. We adopt a curvature-aware strategy to determine the surface thickness and finalize puzzle pieces for 3D printing. Identical hinges and holes are created for assembling the puzzle components. For smoother outcomes, we use triangle subdivision along with curvature-aware clustering, generating curved triangular patches for 3D printing. Our algorithm was evaluated using various models, and the 3D-printed results were analyzed. Findings indicate that our algorithm performs reliably on target organic shapes with minimal loss of input geometry.

READ FULL TEXT

page 1

page 6

page 10

page 11

page 12

page 15

page 16

research
05/22/2023

Estimating Discrete Total Curvature with Per Triangle Normal Variation

We introduce a novel approach for measuring the total curvature at every...
research
10/05/2022

NeuralMeshing: Differentiable Meshing of Implicit Neural Representations

The generation of triangle meshes from point clouds, i.e. meshing, is a ...
research
12/18/2022

SurfaceVoronoi: Efficiently Computing Voronoi Diagrams over Mesh Surfaces with Arbitrary Distance Solvers

In this paper, we propose to compute Voronoi diagrams over mesh surfaces...
research
06/30/2022

Abstract morphing using the Hausdorff distance and Voronoi diagrams

This paper introduces two new abstract morphs for two 2-dimensional shap...
research
08/23/2016

Segmenting a Surface Mesh into Pants Using Morse Theory

A pair of pants is a genus zero orientable surface with three boundary c...
research
11/02/2022

AmiGo: Computational Design of Amigurumi Crochet Patterns

We propose an approach for generating crochet instructions (patterns) fr...
research
05/02/2023

Jacobian-Scaled K-means Clustering for Physics-Informed Segmentation of Reacting Flows

This work introduces Jacobian-scaled K-means (JSK-means) clustering, whi...

Please sign up or login with your details

Forgot password? Click here to reset