I would really appreciate if you could post a minimal example of Dijkstra's Algorithm, for just one source and one target point of the mesh. I found igl:dijkstra function very useful but I am facing difficulties...

An extra null pointer check is not needed in functions like the following.

• LEdge
• [Range_tree_1](https://githu

Introduction
This document is based on the original installation instructions from the following PyMesh documentation:
https://pymesh.readthedocs.io/en/latest/installation.html

It is specifically addressed to those Ubuntu users who are experiencing problems during the PyMesh installation process.
Please read the attached Word document for instructions:
[PyMesh Installation on Ubuntu 18.10.d

Would be nice to restrict shape size min/max per step in the options. This way I would start with huge shapes in the beginning, and progressively in later stages reduce the size when more details should be added.

( Would work great with the focus areas from #3 )