Automatic segmentation

<p>Automatic segmentation of a point cloud presenting a single tree captured by terrestrial laser scanning. The approach uses the neighbor relation of the surface patches whose center points are presented as spheres in this animation. The process starts from the tree base and advances until all surface patches are processed.</p> <p>At every step, a cut set is defined for the current segment. The cut set is basically a layer of surface patches that are either appended to the current segment or marked as a base of a new segment. Whenever the cut set becomes disconnected, each of its components is inspected in various ways to determine whether it belongs to the current segment or not. A component that is not part of the segment is marked as a new base. A segment is completed when it cannot be extended into any unprocessed direction. Upon completion a new base is selected from the process queue.</p> <p>For details of the segmentation process, see the group homepage or, e.g., the open access journal article &quot;Fast Automatic Precision Tree Models from Terrestrial Laser Scanner Data&quot; (http://www.mdpi.com/2072-4292/5/2/491).</p> <p>This animation was produced by the Inverse Problems research group in the Department of Mathematics at Tampere University of Technology (http://math.tut.fi/inversegroup).</p> <p>Animation created using Blender (http://www.blender.org).</p> <p>Music:<br> Firebrand Kevin MacLeod (http://incompetech.com)<br> Licensed under Creative Commons: By Attribution 3.0<br> http://creativecommons.org/licenses/by/3.0/</p> <p>Sound effects:<br> Whooshes - 27 - Wooshes - Dark Rumbling Low.wav<br> Whooshes - 30 - Wooshes - Crackling Energy.wav<br> by koroshiya1 at http://www.freesound.org/<br> Licensed under Creative Commons: By Attribution 3.0<br> http://creativecommons.org/licenses/by/3.0/</p>