Quick one for the mathemagicians... I've tried to google a straight answer for this but kept coming up with over verbose twaddle, and I'm sure someone will know the answers off the top of their head.
I'm constructing a 2d Delaunay triangulation of a set of 2d vertices, and I want to know ahead of time the maximum possible number of triangles and the maximum possible number of edges, given the number of verts.
- I've read a suggestion that the maximum tris may be n+1, where n is the number of verts. Can anyone confirm this?
- No idea on the edges, I'm sure it will be something simple. Obviously it can't be more than 3x the number of triangles, but I'm assuming it will always be lower than this because of triangles sharing edges.
Many thanks!