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