Parametric Point Cloud Completion for Polygonal Surface Reconstruction

• URL: http://arxiv.org/abs/2503.08363v1
• Date: Tue, 11 Mar 2025 12:20:24 GMT
• Title: Parametric Point Cloud Completion for Polygonal Surface Reconstruction
• Authors: Zhaiyu Chen, Yuqing Wang, Liangliang Nan, Xiao Xiang Zhu,
• Abstract summary: Existing polygonal surface reconstruction methods depend on input completeness and struggle with incomplete point clouds.<n>We argue that while current point cloud completion techniques may recover missing points, they are not optimized for polygonal surface reconstruction.<n>We introduce parametric completion, which recovers parametric primitives instead of individual points to convey high-level geometric structures.
• Score: 22.681547465368137
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Existing polygonal surface reconstruction methods heavily depend on input completeness and struggle with incomplete point clouds. We argue that while current point cloud completion techniques may recover missing points, they are not optimized for polygonal surface reconstruction, where the parametric representation of underlying surfaces remains overlooked. To address this gap, we introduce parametric completion, a novel paradigm for point cloud completion, which recovers parametric primitives instead of individual points to convey high-level geometric structures. Our presented approach, PaCo, enables high-quality polygonal surface reconstruction by leveraging plane proxies that encapsulate both plane parameters and inlier points, proving particularly effective in challenging scenarios with highly incomplete data. Comprehensive evaluations of our approach on the ABC dataset establish its effectiveness with superior performance and set a new standard for polygonal surface reconstruction from incomplete data. Project page: https://parametric-completion.github.io.

Related papers

• Learning Bijective Surface Parameterization for Inferring Signed Distance Functions from Sparse Point Clouds with Grid Deformation [50.26314343851213]
  Inferring signed distance functions (SDFs) from sparse point clouds remains a challenge in surface reconstruction. We present a novel approach that learns a dynamic deformation network to predict SDFs in an end-to-end manner. Experimental results on synthetic and real scanned datasets demonstrate that our method significantly outperforms the current state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-03-31T02:27:02Z)
• SymmCompletion: High-Fidelity and High-Consistency Point Cloud Completion with Symmetry Guidance [35.92382553956322]
  We introduce SymmCompletion, a highly effective completion method based on symmetry guidance. Our method comprises two primary components: a Local Symmetry Transformation Network (LSTNet) and a Symmetry-Guidance Transformer (SGFormer)
  arXiv  Detail & Related papers  (2025-03-23T09:45:37Z)
• ParaPoint: Learning Global Free-Boundary Surface Parameterization of 3D Point Clouds [52.03819676074455]
  ParaPoint is an unsupervised neural learning pipeline for achieving global free-boundary surface parameterization. This work makes the first attempt to investigate neural point cloud parameterization that pursues both global mappings and free boundaries.
  arXiv  Detail & Related papers  (2024-03-15T14:35:05Z)
• NeuSurf: On-Surface Priors for Neural Surface Reconstruction from Sparse Input Views [41.03837477483364]
  We propose a novel sparse view reconstruction framework that leverages on-surface priors to achieve highly faithful surface reconstruction. Specifically, we design several constraints on global geometry alignment and local geometry refinement for jointly optimizing coarse shapes and fine details. The experimental results with DTU and BlendedMVS datasets in two prevalent sparse settings demonstrate significant improvements over the state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-12-21T16:04:45Z)
• PRS: Sharp Feature Priors for Resolution-Free Surface Remeshing [30.28380889862059]
  We present a data-driven approach for automatic feature detection and remeshing. Our algorithm improves over state-of-the-art by 26% normals F-score and 42% perceptual $textRMSE_textv$.
  arXiv  Detail & Related papers  (2023-11-30T12:15:45Z)
• 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)
• Voxel-based Network for Shape Completion by Leveraging Edge Generation [76.23436070605348]
  We develop a voxel-based network for point cloud completion by leveraging edge generation (VE-PCN) We first embed point clouds into regular voxel grids, and then generate complete objects with the help of the hallucinated shape edges. This decoupled architecture together with a multi-scale grid feature learning is able to generate more realistic on-surface details.
  arXiv  Detail & Related papers  (2021-08-23T05:10:29Z)
• ME-PCN: Point Completion Conditioned on Mask Emptiness [50.414383063838336]
  Main-stream methods predict missing shapes by decoding a global feature learned from the input point cloud. We present ME-PCN, a point completion network that leverages emptiness' in 3D shape space.
  arXiv  Detail & Related papers  (2021-08-18T15:02:27Z)
• Point Cloud Upsampling and Normal Estimation using Deep Learning for Robust Surface Reconstruction [2.821829060100186]
  We present a novel deep learning architecture for point cloud upsampling. A noisy point cloud of low density with corresponding point normals is used to estimate a point cloud with higher density and appendant point normals.
  arXiv  Detail & Related papers  (2021-02-26T10:58:26Z)
• PMP-Net: Point Cloud Completion by Learning Multi-step Point Moving Paths [54.459879603473034]
  We design a novel neural network, named PMP-Net, to mimic the behavior of an earth mover. It moves each point of the incomplete input to complete the point cloud, where the total distance of point moving paths should be shortest. It learns a strict and unique correspondence on point-level, which can capture the detailed topology and structure relationships between the incomplete shape and the complete target.
  arXiv  Detail & Related papers  (2020-12-07T01:34:38Z)
• Skeleton-bridged Point Completion: From Global Inference to Local Adjustment [48.2757171993437]
  We propose a skeleton-bridged point completion network (SK-PCN) for shape completion. Given a partial scan, our method first predicts its 3D skeleton to obtain the global structure. We decouple the shape completion into structure estimation and surface reconstruction, which eases the learning difficulty.
  arXiv  Detail & Related papers  (2020-10-14T22:49:30Z)

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.