This is the third exercise for the Computational Geometry class.
It focuses on an own implementation of simple polygon triangulation.
You can choose from two variants of the implementation:
Implementation using a simple data structure – list of triangles as triples of point indices without any other topology information stored (the
source), or
Implementation using a DCEL representation from an open-source library OpenMesh (the
source}}).
DL. week 13
Solution.