3D Cartographic Generalization of LiDAR Point Clouds Based on the Principle of Self-Similarity of a Deterministic Fractal Structure

The rendering of virtual three-dimensional (3D) structures represented by Point Cloud (PC) allows the representation of internal and/or external environments to buildings. However, the compilation of 3D geometric models is influenced by the intrinsic characteristics of PCs, which can be mitigated by the application of an PC simplification operator. According to the mathematical norms of fractal geometry, it was assumed that a PC is characterized by self-similarity. Two experimental datasets acquired with an SLT in static mode indoors were used. Four tasks were accomplished: sampling and structuring of a PC to solve the problem of random distribution, from an octree structure; estimation of the curvature of the points and the roughness of a neighbourhood for the extraction of edge points by the analysis of self-similarity and application of the Statistical Outliers Remove (SOR) algorithm, for the elimination of outliers points; uniform voxelization, to simplify the intermediate points; application of the Iterative Closest Point (ICP) algorithm to register the sets generated in the same local coordinate system. The use of voxelization was satisfactory, but once the voxel size is manually defined, the PC can be oversimplified and lose essential characteristics. This can be minimized by the primary analysis of the edge points, generating a set that is uniform, less noisy, and self- similar to the original set. To achieve a minimum density of points to model an environment three-dimensionally, one must analyse the geometric self- similarity characteristics of the PC to produce a simplified set self-similar to the original, considering the premises of fractal geometry. It is recommended to create an automatic simplification process to minimize the subjectivity coming from the analyst.