A Geometric Algorithm for Tubular Shape Reconstruction from Skeletal Representation

• URL: http://arxiv.org/abs/2402.12797v3
• Date: Mon, 1 Jul 2024 15:46:25 GMT
• Title: A Geometric Algorithm for Tubular Shape Reconstruction from Skeletal Representation
• Authors: Guoqing Zhang, Yang Li,
• Abstract summary: We introduce a novel approach for the reconstruction of tubular shapes from skeletal representations. Our method processes all skeletal points as a whole, eliminating the need for splitting input structure into multiple segments.
• Score: 4.105722858061442
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a novel approach for the reconstruction of tubular shapes from skeletal representations. Our method processes all skeletal points as a whole, eliminating the need for splitting input structure into multiple segments. We represent the tubular shape as a truncated signed distance function (TSDF) in a voxel hashing manner, in which the signed distance between a voxel center and the object is computed through a simple geometric algorithm. Our method does not involve any surface sampling scheme or solving large matrix equations, and therefore is a faster and more elegant solution for tubular shape reconstruction compared to other approaches. Experiments demonstrate the efficiency and effectiveness of the proposed method. Code is avaliable at https://github.com/wlsdzyzl/Dragon.

Related papers

• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• Curvy: A Parametric Cross-section based Surface Reconstruction [2.1165011830664677]
  We present a novel approach for reconstructing shape point clouds using planar sparse cross-sections with the help of generative modeling. We use a compact parametric polyline representation using adaptive splitting to represent the cross-sections and perform learning using a Graph Neural Network to reconstruct the underlying shape.
  arXiv  Detail & Related papers  (2024-09-01T20:15:08Z)
• Coverage Axis++: Efficient Inner Point Selection for 3D Shape Skeletonization [49.47444127373479]
  Coverage Axis++ is a novel and efficient approach to 3D shape skeletonization. It offers a high-accuracy approximation of the Medial Axis Transform (MAT)
  arXiv  Detail & Related papers  (2024-01-23T18:07:07Z)
• 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)
• GeoUDF: Surface Reconstruction from 3D Point Clouds via Geometry-guided Distance Representation [73.77505964222632]
  We present a learning-based method, namely GeoUDF, to tackle the problem of reconstructing a discrete surface from a sparse point cloud. To be specific, we propose a geometry-guided learning method for UDF and its gradient estimation. To extract triangle meshes from the predicted UDF, we propose a customized edge-based marching cube module.
  arXiv  Detail & Related papers  (2022-11-30T06:02:01Z)
• Implicit Neural Representation for Mesh-Free Inverse Obstacle Scattering [21.459567997723376]
  Implicit representation of shapes as level sets of multilayer perceptrons has recently flourished in different shape analysis, compression, and reconstruction tasks. We introduce an implicit neural representation-based framework for solving the inverse obstacle scattering problem in a mesh-free fashion.
  arXiv  Detail & Related papers  (2022-06-04T17:16:09Z)
• 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)
• Unsupervised Learning for Cuboid Shape Abstraction via Joint Segmentation from Point Clouds [8.156355030558172]
  Representing complex 3D objects as simple geometric primitives, known as shape abstraction, is important for geometric modeling, structural analysis, and shape synthesis. We propose an unsupervised shape abstraction method to map a point cloud into a compact cuboid representation.
  arXiv  Detail & Related papers  (2021-06-07T09:15:16Z)
• ResNet-LDDMM: Advancing the LDDMM Framework Using Deep Residual Networks [86.37110868126548]
  In this work, we make use of deep residual neural networks to solve the non-stationary ODE (flow equation) based on a Euler's discretization scheme. We illustrate these ideas on diverse registration problems of 3D shapes under complex topology-preserving transformations.
  arXiv  Detail & Related papers  (2021-02-16T04:07:13Z)
• Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondence [31.840880075039944]
  We present a novel learning-based approach for computing correspondences between non-rigid 3D shapes. Key to our method is a feature-extraction network that learns directly from raw shape geometry.
  arXiv  Detail & Related papers  (2020-03-31T15:20:17Z)

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.