Determination of radial segmentation of point clouds using K-D trees with the algorithm rejecting subtrees

Abstract

This paper presents an innovative computer graphic method for viewshed generation from big point clouds. The proposed approach consists in simplification of typical methods for viewshed formation that are based on sorting and binary trees. The proposed method is based on the k-d tree concept optimized with radial segmentation and a dedicated mathematical algorithm for subtree rejection. The final visualization of the viewshed is designed with a graphic method using triangulated irregular network (TIN) surfaces from the accepted subtrees.