•  
  •  
 

Journal of System Simulation

Abstract

Abstract: Ball Pivoting algorithm is mainly used for surface reconstruction of point cloud data, the algorithm starts from a seed triangle, the ball along the seed triangle a side of rotation until the ball is exposed to a point and the edge and the composition of a triangle. The main disadvantage of this algorithm is that when the point cloud data is not uniform when the ball in the rolling process does not contact the point, and therefore will have a hole. A non-uniform point cloud data for improved reconstruction of the Ball Pivoting algorithm of the original point cloud data was proposed to construct k-d tree, allowing searching area algorithm time efficiency; variable radius search algorithm could make the algorithm deal with non-uniform point cloud data and did not produce hole, putting forward the more being a searching area algorithm, to optimize the topology structure of the grid. The experimental results show that the algorithm is efficient and cannot generate the holes and the topological structure of the triangle mesh is better than the Ball Pivoting algorithm.

First Page

2446

Revised Date

2015-07-31

Last Page

2452

CLC

TP391.9

Recommended Citation

Hu Silan, Zhou Mingquan, Shui Wuyang, Wu Zhongke. Improved Pivoting Ball Algorithm for Nonuniform Point Cloud Data[J]. Journal of System Simulation, 2015, 27(10): 2446-2452.

Share

COinS