CGAL users discussion list

[Stefan Salewski <>]

On Fri, 2014-01-03 at 20:53 +0100, Stefan Salewski wrote:
> One strategy may be:
> -Create the delaunay triangulation.
> -Remove all vertices which have no closely spaced neighbor.

Of course the next step may be something like generation the (euklidian)
minimal spanning tree, and then removing edges which are longer than a
defined distance value. The remaining problem is edge detection --
assume we have two or more lines which touch or even cross. How can I
separate that shape into two lines, without some strange point
neighborhood probing?