Affiliations: [a] School of Engineering, Royal Melbourne Institute of Technology University, Victoria, Australia
| [b] Department of Control and Instrumentation Engineering, Korea University, Rep. of Korea
| [c] Department of Computer and Information Science, Korea University, Rep. of Korea
Correspondence:
[*]
Corresponding author. Joono Cheong, Department of Control and Instrumentation Engineering, Korea University, Sejong-City, 30019, Rep. of Korea. E-mail: jncheong@korea.ac.kr.
Abstract: We present a novel technique for 3D point cloud simplification — the so-called fractal bubble algorithm — to minimize the computational time and overall storage space. The proposed fractal bubble algorithm generates 2D elastic bubbles and copies of themselves through 2D data sets representing planar geometric contours. Each of the bubbles, as it grows, is made to select a single point of its first contact, and all the selected points become the simplified set of points. The fractal bubble algorithm is repeatedly applied to the simplification of planar slices of general 3D point clouds corresponding to 3D geometric objects, leading to the global simplification of 3D point clouds. The benefits of the algorithm are: first the algorithm is computationally light and memory efficient, second it is simple to implement and inherently allows the organized selection of the points of contact and finally it enables us to simplify the point cloud data through a multi-scale fashion by varying a set of user-controlled algorithm parameters. Numerical results verify the effectiveness of the proposed algorithm.
Keywords: 3D point cloud, fractal bubble algorithm, data simplification, multi-scale reduction
