2006Unpublished venueRequires access

An Efficient Method to Mesh Point Cloud

Guiping Qian, Ruofeng Tong, Wen Ting Peng, Jinxiang Dong

Open publisher page 1 citations

Abstract

This paper presents a new reverse engineering method for creating 3D mesh models, which approximate an unorganized noisy point set without orientation information. The new method computes sample points by the extended moving least squares method in adaptive octree cell. The octree subdivision is decided by weighted covariance matrix. Then the points are connected by intersections of supported spheres. Further, the triangular meshes are refined to remove non-manifold parts and holes. The new algorithm allows us to construct mesh models from very large point set quickly

About this research paper

What this paper is about

This paper presents a new reverse engineering method for creating 3D mesh models, which approximate an unorganized noisy point set without orientation information. The new method computes sample points by the extended moving least squares method in adaptive octree cell. The octree subdivision is decided by weighted covariance matrix. Then the points are connected by intersections of supported spheres. Further, the triangular meshes are refined to remove non-manifold parts and holes. The new algorithm allows us to construct mesh models from very large point set quickly

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a new reverse engineering method for creating 3D mesh models, which approximate an unorganized noisy point set without orientation information. The new method computes sample points by the extended moving least squares method in adaptive octree cell. The octree subdivision is decided by weighted covariance matrix. Then the points are connected by intersections of supported spheres. Further, the triangular meshes are refined to remove non-manifold parts and holes. The new algorithm allows us to construct mesh models from very large point set quickly

Key concepts: Octree, Point cloud, Polygon mesh, Reverse engineering, Subdivision, Computer science, Point (geometry), Mesh generation

Related papers

Back to paper searchBrowse research topicsOriginal source
An Efficient Method to Mesh Point Cloud — Research Paper | ScholarLens