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

• URL: http://arxiv.org/abs/2304.02941v2
• Date: Mon, 24 Jul 2023 10:57:15 GMT
• Title: Dr. KID: Direct Remeshing and K-set Isometric Decomposition for Scalable Physicalization of Organic Shapes
• Authors: Dawar Khan, Ciril Bohak, Ivan Viola
• Abstract summary: Dr. KID is an algorithm that uses isometric decomposition for the physicalization of potato-shaped organic models in a puzzle fashion. For clustering, we need similarity between triangles which is defined as a distance function. For smoother outcomes, we use triangle subdivision along with curvature-aware clustering, generating curved triangular patches for 3D printing.
• Score: 5.385289130801911
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: 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.

Related papers

• Geometrically Consistent Partial Shape Matching [50.29468769172704]
  Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. An often neglected but essential property of matching geometrics is consistency. We propose a novel integer linear programming partial shape matching formulation.
  arXiv  Detail & Related papers  (2023-09-10T12:21:42Z)
• Zero-Shot 3D Shape Correspondence [67.18775201037732]
  We propose a novel zero-shot approach to computing correspondences between 3D shapes. We exploit the exceptional reasoning capabilities of recent foundation models in language and vision. Our approach produces highly plausible results in a zero-shot manner, especially between strongly non-isometric shapes.
  arXiv  Detail & Related papers  (2023-06-05T21:14:23Z)
• CircNet: Meshing 3D Point Clouds with Circumcenter Detection [67.23307214942696]
  Reconstructing 3D point clouds into triangle meshes is a key problem in computational geometry and surface reconstruction. We introduce a deep neural network that detects the circumcenters to achieve point cloud triangulation. We validate our method on prominent datasets of both watertight and open surfaces.
  arXiv  Detail & Related papers  (2023-01-23T03:32:57Z)
• Approximate Convex Decomposition for 3D Meshes with Collision-Aware Concavity and Tree Search [23.52274863244624]
  Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components. It has been widely used in game engines, physics simulations, and animation. We propose a novel method that addresses the limitations of existing approaches from three perspectives.
  arXiv  Detail & Related papers  (2022-05-05T23:40:15Z)
• A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching [69.14632473279651]
  We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
  arXiv  Detail & Related papers  (2022-04-27T09:47:47Z)
• Learning Geometry-Disentangled Representation for Complementary Understanding of 3D Object Point Cloud [50.56461318879761]
  We propose Geometry-Disentangled Attention Network (GDANet) for 3D image processing. GDANet disentangles point clouds into contour and flat part of 3D objects, respectively denoted by sharp and gentle variation components. Experiments on 3D object classification and segmentation benchmarks demonstrate that GDANet achieves the state-of-the-arts with fewer parameters.
  arXiv  Detail & Related papers  (2020-12-20T13:35:00Z)
• PUGeo-Net: A Geometry-centric Network for 3D Point Cloud Upsampling [103.09504572409449]
  We propose a novel deep neural network based method, called PUGeo-Net, to generate uniform dense point clouds. Thanks to its geometry-centric nature, PUGeo-Net works well for both CAD models with sharp features and scanned models with rich geometric details.
  arXiv  Detail & Related papers  (2020-02-24T14:13:29Z)
• 3D Shape Segmentation with Geometric Deep Learning [2.512827436728378]
  We propose a neural-network based approach that produces 3D augmented views of the 3D shape to solve the whole segmentation as sub-segmentation problems. We validate our approach using 3D shapes of publicly available datasets and of real objects that are reconstructed using photogrammetry techniques.
  arXiv  Detail & Related papers  (2020-02-02T14:11:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.