Estimating Discrete Total Curvature with Per Triangle Normal Variation

• URL: http://arxiv.org/abs/2305.12653v1
• Date: Mon, 22 May 2023 02:52:29 GMT
• Title: Estimating Discrete Total Curvature with Per Triangle Normal Variation
• Authors: Crane He Chen
• Abstract summary: We introduce a novel approach for measuring the total curvature at every triangle of a discrete surface. This method takes advantage of the relationship between per triangle total curvature and the Dirichlet energy of the Gauss map.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a novel approach for measuring the total curvature at every triangle of a discrete surface. This method takes advantage of the relationship between per triangle total curvature and the Dirichlet energy of the Gauss map. This new tool can be used on both triangle meshes and point clouds and has numerous applications. In this study, we demonstrate the effectiveness of our technique by using it for feature-aware mesh decimation, and show that it outperforms existing curvature-estimation methods from popular libraries such as Meshlab, Trimesh2, and Libigl. When estimating curvature on point clouds, our method outperforms popular libraries PCL and CGAL.

Related papers

• von Mises Quasi-Processes for Bayesian Circular Regression [57.88921637944379]
  We explore a family of expressive and interpretable distributions over circle-valued random functions. The resulting probability model has connections with continuous spin models in statistical physics. For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Markov Chain Monte Carlo sampling.
  arXiv  Detail & Related papers  (2024-06-19T01:57:21Z)
• Self-Supervised Learning for Multimodal Non-Rigid 3D Shape Matching [15.050801537501462]
  We introduce a self-supervised multimodal learning strategy that combines mesh-based functional map regularisation with a contrastive loss that couples mesh and point cloud data. Our shape matching approach allows to obtain intramodal correspondences for triangle meshes, complete point clouds, and partially observed point clouds. We demonstrate that our method achieves state-of-the-art results on several challenging benchmark datasets.
  arXiv  Detail & Related papers  (2023-03-20T09:47:02Z)
• Semantic Segmentation of Urban Textured Meshes Through Point Sampling [0.0]
  We study the influence of different parameters such as the sampling method, the density of the extracted cloud, the features selected and the number of points used at each training period. Our result outperforms the state-of-the-art on the SUM dataset, earning about 4 points in OA and 18 points in mIoU.
  arXiv  Detail & Related papers  (2023-02-21T12:49:31Z)
• Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
  We present two new classes of algorithms for efficient field integration on graphs encoding point clouds. The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
  arXiv  Detail & Related papers  (2023-02-02T08:33:36Z)
• 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)
• Robust and Accurate Cylinder Triangulation [23.35080249212613]
  We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. We derive a fast minimal solver based on three image silhouette lines, that can be used to bootstrap robust estimation schemes. We also present a constrained least squares solver that can incorporate all available image lines for accurate estimation.
  arXiv  Detail & Related papers  (2022-12-05T14:42:40Z)
• 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)
• NeuralMeshing: Differentiable Meshing of Implicit Neural Representations [63.18340058854517]
  We propose a novel differentiable meshing algorithm for extracting surface meshes from neural implicit representations. Our method produces meshes with regular tessellation patterns and fewer triangle faces compared to existing methods.
  arXiv  Detail & Related papers  (2022-10-05T16:52:25Z)
• Differentiable Surface Triangulation [40.13834693745158]
  We present a differentiable surface triangulation that enables optimization for any per-vertex or per-face differentiable objective function over the space of underlying surface triangulations. Our method builds on the result that any 2D triangulation can be achieved by a suitably weighted Delaunay triangulation. We extend the algorithm to 3D by decomposing shapes into developable sets and differentiably meshing each set with suitable boundary constraints.
  arXiv  Detail & Related papers  (2021-09-22T12:42:43Z)
• 3D Parametric Wireframe Extraction Based on Distance Fields [33.17232234301046]
  We present a pipeline for parametric wireframe extraction from point clouds. Our approach processes a scalar distance field that represents proximity to the nearest sharp feature curve. In intermediate stages, it detects corners, constructs curve segmentation, and builds a topological graph fitted to the wireframe.
  arXiv  Detail & Related papers  (2021-07-13T15:25:14Z)
• 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)

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.