Implemenatation of primitive operations in DCEL in C language
The doubly connected edge list (DCEL), also known as half-edge data structure, is a data structure to represent an embedding of a planar graph in the plane, and polytopes in 3D. For more information -> https://en.wikipedia.org/wiki/Doubly_connected_edge_list
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate.