A survey of construction and manipulation of octrees
Computer Vision, Graphics, and Image Processing
A Sequential 3D Thinning Algorithm and Its Medical Applications
IPMI '01 Proceedings of the 17th International Conference on Information Processing in Medical Imaging
Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®
Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®
Loops in Reeb Graphs of 2-Manifolds
Discrete & Computational Geometry
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Curve-Skeleton Properties, Applications, and Algorithms
IEEE Transactions on Visualization and Computer Graphics
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Defining and computing curve-skeletons with medial geodesic function
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
Automatic reconstruction of tree skeletal structures from point clouds
ACM SIGGRAPH Asia 2010 papers
Texture-lobes for tree modelling
ACM SIGGRAPH 2011 papers
Synthetic tree models from iterated discrete graphs
Proceedings of Graphics Interface 2012
Tree branching reconstruction from unilateral point clouds
Transactions on Edutainment VIII
Graphics Interaction: A procedural method for irregular tree models
Computers and Graphics
| Hi-index | 0.00 |
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a botanical tree without leafs. The resulting skeleton can subsequently be applied to obtain tree parameters like length and diameter of branches for botanic applications. Scanner-produced point cloud data are not only subject to noise, but also to undersampling and varying point densities, making it challenging to extract a topologically correct skeleton. The skeletonisation algorithm proposed in this paper consists of three steps: (i) extraction of a graph from an octree organization, (ii) reduction of the graph to the skeleton and (iii) embedding of the skeleton into the point cloud. The results are validated on laser scanner point clouds representing botanic trees. On a reference tree, the mean and maximal distance of the point cloud points to the skeleton could be reduced from 1.8 to 1.5 cm for the mean and from 15.6 to 10.5 cm for the maximum, compared to results from a previously developed method.