Create 2d triangles from 2d points

Question

I have to make 2d triangles from a list of 2d points with a condition: length of any edge can't be longer than a predefined constant.

Something like this:

Do you know any algorithm that can do this? Or any advise?

Thanks!

Answer 1

Try Delaunay triangulation , then remove any edges which are too long.

From the above article, you see a link to CGAL's 2D triangulation page .

Answer 2

First, generate all possible edges (ie connecting a pair of vertices that are closer than the constant). Then when two of them intersect, remove one of them. Repeat this step until there are no intersections.

This solution is quite primitive, it's probably possible to do it faster.

Answer 3

I like svick's answer -

when implementing I would do the following

1. calculate the lines between every pair of points
2. Sort the list by length
3. Remove all lines longer than your threshold
4. Continue down the list (longest to shortest) if it crosses another line then remove it.