Scholarlink

<p>We propose a method to estimate normal vectors from noisy 3D point cloud data, with a focus on preserving first-order discontinuities of the underlying surface. The crease-aware normal vector (CNV) is computed per point without requiring any triangulated surface nor connectivity information. The main idea of the proposed work is to find a suitable subset of the neighborhood which gives denoised surface normals close to the true ones, especially near the crease, e.g., ridges and valleys. We first introduce a flatness measure for any given set of points in <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathbb {R}^{3}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mn>3</mn> </msup> </math></EquationSource> </InlineEquation> by considering the local principal directions. We propose a method to partition the neighborhood and select the flattest one through our flatness measure. We provide analysis to show that the proposed subset can give the true normal vectors for points near creases. We present various numerical experiments showing that the proposed method gives clearer first-order discontinuities, and we further showcase its applications to surface reconstruction from noisy and incomplete point clouds, and solving PDEs on unstructured point clouds using crease-aware normal vectors.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Crease-Aware Normal Vectors from Unstructured Point Clouds

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年6月30日

查看全文
  • Ho Law,
  • Sung Ha Kang

摘要

We propose a method to estimate normal vectors from noisy 3D point cloud data, with a focus on preserving first-order discontinuities of the underlying surface. The crease-aware normal vector (CNV) is computed per point without requiring any triangulated surface nor connectivity information. The main idea of the proposed work is to find a suitable subset of the neighborhood which gives denoised surface normals close to the true ones, especially near the crease, e.g., ridges and valleys. We first introduce a flatness measure for any given set of points in \(\mathbb {R}^{3}\) R 3 by considering the local principal directions. We propose a method to partition the neighborhood and select the flattest one through our flatness measure. We provide analysis to show that the proposed subset can give the true normal vectors for points near creases. We present various numerical experiments showing that the proposed method gives clearer first-order discontinuities, and we further showcase its applications to surface reconstruction from noisy and incomplete point clouds, and solving PDEs on unstructured point clouds using crease-aware normal vectors.