Hi i am looking for algorithms to decide whether a planar pointset has a eulerian triangulation i.e. a triangulation that makes every vertex of even degree.
I cam across this page http://cs.anu.edu.au/~bdm/plantri/ which implements a program to do the above but the algorithm was not clear to me.
Any idea to design algorithm for the above problem will be helpfull. Any link/paper to easier discussion is also welcome.