Subject: CGAL users discussion list
List archive
- From: Stefan Salewski <>
- To:
- Subject: Re: [cgal-discuss] Curve or path reconstruction question
- Date: Fri, 03 Jan 2014 22:55:10 +0100
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?
- [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/02/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Andreas Fabri, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Sebastien Loriot (GeometryFactory), 01/07/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/07/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, isscandar, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Stefan Salewski, 01/03/2014
- Re: [cgal-discuss] Curve or path reconstruction question, Andreas Fabri, 01/03/2014
Archive powered by MHonArc 2.6.18.