I'd like to triangulate a room full of polygonal obstacles. 

I'm particularly looking for an **easy algorithm to implement** as I'm testing other functionality at the moment. Efficiency (given it can handle a few 10s of vertices within a minute) and 'quality' of the triangles won't be a consideration. Right now my thought is to loop through each vertex, checking for other vertices which it can connect to without crossing previously made connections. Are there simpler solutions or any flaws to this approach?

Thanks