Implementation of the 2-D Case of Monma & Suri's "Transitions in Geometric Minimum Spanning Trees" as part of my Bachelor's Thesis.
Their Algorithm, however, seems to produce Errors. See "Bsc.pdf" and run the GUI for more details.


Python Requirements:
- Project requires python3.8


Required Python Packages:
- tkinter
  https://tkdocs.com/tutorial/install.html

- matplotlib
  https://matplotlib.org/3.1.1/users/installing.html

- shapely
  https://shapely.readthedocs.io/en/stable/project.html

- numpy / scipy
  https://numpy.org/install/
  https://www.scipy.org/scipylib/download.html

- blist (allows faster list operations)
  https://pypi.org/project/blist/


Run:
 - Start Program by
   python3.8 GUI.py


Basic Functions:
- Add points to the coordinate system to build an EMST

- Compute regions in which all points, when added to the existing EMST,
  share the same topology

- Draw a line through the regions and view all EMSTs along the line

- Display regions for which the topology is falsely calculated