This repository contains the source code of the experiments described in Short Plane Supports for Spatial Hypergraphs. Please refer to the source README for details on how to run the code. The data generated by this code, underlying the experimental results presented in the paper, can also be found in this repository.

To build and run this project, you will need to include the JAR files in lib/ in your classpath.

• We use GeometryCore amongst others for its graph data structures, to find (E)MSTs, and for rendering and outputting supports. This is the main dependency of the project.
• The JTS Topology Suite is used in the Kelp rendering code. Excluding Kelp rendering capabilities would make it possible to drop this dependency.
• We use SnakeYAML to read and write YAML files for batch processing. Excluding batch processing capabilities would make it possible to drop this dependency.

Aside from the JAR files bundled in this repository, we also depend on CPLEX and its Java bindings. CPLEX is available for free for academic purposes.

It is currently not possible to easily disable functionality and remove the need for the last three dependencies, even if they are used in small parts of the code base only. This means that all dependencies need to be met before the code can be compiled and run.

• T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, and X. Yuan. Short Plane Support Trees for Hypergraphs. In abstr. 34th European Workshop on Computational Geometry (EuroCG), pp. 35:1–35:6, 2018.
• T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, and X. Yuan. Short Plane Supports for Spatial Hypergraphs. In proc. Graph Drawing and Network Visualization (GD), volume 11282 of LNCS, pp. 1–14, 2018.
• T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, and X. Yuan. Short Plane Supports for Spatial Hypergraphs. Special Issue of the Journal of Graph Algorithms and Applications, under review.