Intro: Computation and visualization of 3D minimum spanning trees.

This is the introduction to a series of videos showing how to compute and visualize a 3D minimum spanning tree from a set of random points. I show * how to use CGAL to triangulate the points. https://youtu.be/vJ1dtSJKPGo * how to use Boost Graph Library to compute the MST https://youtu.be/GSp2531Wti4 * how to use Paraview application to visualize the result https://youtu.be/mNR2Vn6r0io All examples can be found here: https://github.com/mmccoo/nerd_mmccoo In all cases, the intent is to explain generically how to use the tools and libary to enable you to use them for your own purposes. The 3D MST is just a context within which to teach.