Hybrid Tree Reconstruction From Inhomogeneous Point Clouds

In: The Visual Computer (June 2014), 30:6-8
 

Abstract

Trees are an important asset for natural-looking digital environments. We propose a novel method to automatically reconstruct tree geometry from inhomogeneous point clouds created by a laser scanner. While previous approaches focus either on dense or sparse point clouds, our hybrid method allows for the reconstruction of a tree from an inhomogeneous point cloud without further preprocessing. Using principal curvatures as indicators for branches, we detect ellipses in branch cross-sections and create branch skeletons for dense regions. For sparse regions we approximate branch skeletons with a spanning tree. Branch widths are obtained from the ellipse fitting in dense regions and propagated to the sparse regions, in order to create geometry for the whole tree. We demonstrate the effectiveness of our approach in several real-world examples.

Keywords: point cloud, Reconstruction, Trees

Images

Download Paper

Download Paper

Bibtex

@ARTICLE{aiteanu-2014-trees,
     author = {Aiteanu, Fabian and Klein, Reinhard},
      title = {Hybrid Tree Reconstruction From Inhomogeneous Point Clouds},
    journal = {The Visual Computer},
     volume = {30},
     number = {6-8},
       year = {2014},
      month = jun,
  publisher = {Springer Berlin Heidelberg},
   keywords = {point cloud, Reconstruction, Trees},
   abstract = {Trees are an important asset for natural-looking digital environments. We propose a novel method to
               automatically reconstruct tree geometry from inhomogeneous point clouds created by a laser scanner.
               While previous approaches focus either on dense or sparse point clouds, our hybrid method allows for
               the reconstruction of a tree from
               an inhomogeneous point cloud without further preprocessing. Using principal curvatures as indicators
               for branches, we detect ellipses in branch cross-sections and create branch
               skeletons for dense regions. For sparse regions we approximate branch skeletons with a spanning
               tree. Branch widths are obtained from the ellipse fitting in dense regions and
               propagated to the sparse regions, in order to create geometry for the whole tree. We demonstrate the
               effectiveness of our approach in several real-world examples.},
       issn = {0178-2789},
        url = {http://dx.doi.org/10.1007/s00371-014-0977-7},
        doi = {10.1007/s00371-014-0977-7}
}