Traditional point cloud registration methods require large overlap between scans, which imposes strict constraints on data acquisition. To facilitate registration, users have to carefully position scanners to ensure sufficient overlap. In this work, we propose to use high-level structural information (i.e., plane/line features and their inter-relationship) for registration, which is capable of registering point clouds with small overlap, allowing more freedom in data acquisition. We design a novel plane/linebased descriptor dedicated to establishing structure level correspondences between point clouds. Based on this descriptor, we propose a simple but effective registration algorithm. We also provide a dataset of real-world scenes containing a larger number of scans with a wide range of overlap. Experiments and comparisons with state-of-the-art methods on various datasets reveal that our method is superior to existing techniques. Though the proposed algorithm outperforms state-of-the-art methods on the most challenging dataset, the point cloud registration problem is still far from being solved, leaving significant room for improvement and future work.

Laser scanning is an effective tool for acquiring geometric attributes of trees and vegetation, which lays a solid foundation for 3-dimensional tree modelling. Existing studies on tree modelling from laser scanning data are vast. However, some works cannot guarantee sufficient modelling accuracy, while some other works are mainly rule-based and therefore highly depend on user inputs. In this paper, we propose a novel method to accurately and automatically reconstruct detailed 3D tree models from laser scans. We first extract an initial tree skeleton from the input point cloud by establishing a minimum spanning tree using the Dijkstra shortest-path algorithm. Then, the initial tree skeleton is pruned by iteratively removing redundant components. After that, an optimization-based approach is performed to fit a sequence of cylinders to approximate the geometry of the tree branches. Experiments on various types of trees from different data sources demonstrate the effectiveness and robustness of our method. The overall fitting error (i.e., the distance between the input points and the output model) is less than 10 cm. The reconstructed tree models can be further applied in the precise estimation of tree attributes, urban landscape visualization, etc. The source code of this work is freely available at https://github.com/tudelft3d/adtree

In 3D printing, it is critical to use as few as possible supporting materials for efficiency and material saving. Multiple model decomposition methods and multi-DOF (degrees of freedom) 3D printers have been developed to address this issue. However, most systems utilize model decomposition and multi-DOF independently. Only a few existing approaches combine the two, i.e. partitioning the models for multi-DOF printing. In this paper, we present a novel model decomposition method for multidirectional 3D printing, allowing consistent printing with the least cost of supporting materials. Our method is based on a global optimization that minimizes the surface area to be supported for a 3D model. The printing sequence is determined inherently by minimizing a single global objective function. Experiments on various complex 3D models using a five-DOF 3D printer have demonstrated the effectiveness of our approach.

No abstract uploaded!

No abstract uploaded!