Computational Geometry Package

السلام عليكم و رحمة الله

In the Computational Geometry course, we were required to deliver a package containing some algorithms implementations, like:
- Line intersections tester, with the naive way and sweep line algorithms:

- Convex polygon constructor, also with naive and Graham Hull algorithms:

- Polygon triangulation algorithm:
I liked this one a lot, I made it in the package delivery day morning :D me and Eman used to draw some polygons on my laptop for tracing :D

- and finally, the DCEL (Doubly Connected Edge List) data structure.

I built the data structure itself, tested its functions, and didn't know what to do with it :D so delivered it as it is! 

You can try them from here.