Slicing a Point Cloud
Hyeong-T. Park, Min-H. Chang, Sang-C. Park · Korean Journal of Computational Design and Engineering · 2007
Presented in the paper is an algorithm to generate a section curve by slicing a point cloud which may include tens of thousands of points. Although there are couple of previous results, they are very sensitive on the density variations and local noising points. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-circle diagram. The algorithm has been implemented and tested with various examples.