This is an implementation of the Bentley Ottmann algorithm in Python 3.
Launch program with default parameters
./bo.py filename [filename]*
files are binary file composed of segments (a succession of 4 points).
example files are present on the test folder.
The program display the result in the treminal if tycat (on terminology) and save images on temporary folder.
The script test.py test the algorithm on files present in the tests folder and check the number of intersections.