Flexible Mesh Segmentation via Reeb Graph Representation of Geometrical and Topological Features

• URL: http://arxiv.org/abs/2412.05335v2
• Date: Mon, 20 Jan 2025 18:50:07 GMT
• Title: Flexible Mesh Segmentation via Reeb Graph Representation of Geometrical and Topological Features
• Authors: Florian Beguet, Sandrine Lanquetin, Romain Raffin,
• Abstract summary: This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation.<n>The algorithm consists of three phases: construction of the Reeb graph using the improved topological skeleton approach, topological simplification of the graph by cancelling critical points while preserving essential features, and generation of contiguous segments via an adaptive region-growth process.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation. The algorithm consists of three phases: construction of the Reeb graph using the improved topological skeleton approach, topological simplification of the graph by cancelling critical points while preserving essential features, and generation of contiguous segments via an adaptive region-growth process that takes geometric and topological criteria into account. Operating with a computational complexity of O(n log(n)) for a mesh of n vertices, the method demonstrates both efficiency and scalability. An evaluation through case studies, including part-based decomposition with Shape Diameter Function and terrain analysis with Shape Index, validates the effectiveness of the method in completely different applications. The results establish this approach as a robust framework for advanced geometric analysis of meshes, connecting the geometric and topological features of shapes.

Related papers

• Cover Learning for Large-Scale Topology Representation [0.0]
  We describe a method for learning topologically-faithful covers of geometric datasets. We show that the simplicial complexes thus obtained can outperform standard topological inference approaches in terms of size.
  arXiv  Detail & Related papers  (2025-03-12T19:10:20Z)
• STITCH: Surface reconstrucTion using Implicit neural representations with Topology Constraints and persistent Homology [23.70495314317551]
  We present STITCH, a novel approach for neural implicit surface reconstruction of a sparse and irregularly spaced point cloud. We develop a new differentiable framework based on persistent homology to formulate topological loss terms that enforce the prior of a single 2-manifold object.
  arXiv  Detail & Related papers  (2024-12-24T22:55:35Z)
• Differentiable Topology Estimating from Curvatures for 3D Shapes [5.122262236258208]
  This paper introduces a novel, differentiable algorithm tailored to accurately estimate the global topology of 3D shapes. It ensures high accuracy, efficiency, and instant computation with GPU compatibility. Experimental results demonstrate the method's superior performance across various datasets.
  arXiv  Detail & Related papers  (2024-11-28T17:14:35Z)
• SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
  We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network. Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh. In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
  arXiv  Detail & Related papers  (2024-09-30T17:59:03Z)
• Graph Vertex Embeddings: Distance, Regularization and Community Detection [0.0]
  Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space. We present a family of flexible distance functions that faithfully capture the topological distance between different vertices. We evaluate the effectiveness of our proposed embedding constructions by performing community detection on a host of benchmark datasets.
  arXiv  Detail & Related papers  (2024-04-09T09:03:53Z)
• A Survey of Geometric Graph Neural Networks: Data Structures, Models and Applications [71.809127869349]
  This paper formalizes geometric graph as the data structure, on top of which we provide a unified view of existing models from the geometric message passing perspective. We also summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation.
  arXiv  Detail & Related papers  (2024-03-01T12:13:04Z)
• Neural ShDF: Reviving an Efficient and Consistent Mesh Segmentation Method [0.0]
  We present a data-driven approach leveraging deep learning to encode a mapping function prior to mesh segmentation. Our approach is resolution-agnostic as we downsample the input meshes and query the full-resolution structure.
  arXiv  Detail & Related papers  (2023-06-14T18:27:39Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Self-supervised Geometric Perception [96.89966337518854]
  Self-supervised geometric perception is a framework to learn a feature descriptor for correspondence matching without any ground-truth geometric model labels. We show that SGP achieves state-of-the-art performance that is on-par or superior to the supervised oracles trained using ground-truth labels.
  arXiv  Detail & Related papers  (2021-03-04T15:34:43Z)
• Primal-Dual Mesh Convolutional Neural Networks [62.165239866312334]
  We propose a primal-dual framework drawn from the graph-neural-network literature to triangle meshes. Our method takes features for both edges and faces of a 3D mesh as input and dynamically aggregates them. We provide theoretical insights of our approach using tools from the mesh-simplification literature.
  arXiv  Detail & Related papers  (2020-10-23T14:49:02Z)
• SEG-MAT: 3D Shape Segmentation Using Medial Axis Transform [49.51977253452456]
  We present an efficient method for 3D shape segmentation based on the medial axis transform (MAT) of the input shape. Specifically, with the rich geometrical and structural information encoded in the MAT, we are able to identify the various types of junctions between different parts of a 3D shape. Our method outperforms the state-of-the-art methods in terms of segmentation quality and is also one order of magnitude faster.
  arXiv  Detail & Related papers  (2020-10-22T07:15:23Z)
• Neural Subdivision [58.97214948753937]
  This paper introduces Neural Subdivision, a novel framework for data-driven coarseto-fine geometry modeling. We optimize for the same set of network weights across all local mesh patches, thus providing an architecture that is not constrained to a specific input mesh, fixed genus, or category. We demonstrate that even when trained on a single high-resolution mesh our method generates reasonable subdivisions for novel shapes.
  arXiv  Detail & Related papers  (2020-05-04T20:03:21Z)

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.