GLU tesselator

Hello guys,

My question is this:
Given an input of N vertices of a polygon to the GLU tesselation algorithm, what is the maximum number of vertices / triangles expected as output? :confused:

There’s a lemma from computational geometry that says that every triangulation of a simple polygon (no holes, no edge crossings) with n vertices has n - 2 triangles.

Nonsimple polygons are another matter, and I don’t know if there’s a magic formula relating the number of vertices, holes and crossings (I’d sure like to know it, if it exists).

Thanks a lot caveman for your answer.