Subject: CGAL users discussion list
List archive
- From: Stefan Salewski <>
- To:
- Subject: [cgal-discuss] Curve or path reconstruction question
- Date: Thu, 02 Jan 2014 20:46:27 +0100
I have a set of points in 2D, subsets of these build line segments like
this graphic:
....
.... . .
. .
. . .
.
.
. ......
. .
. .
......
Two to a few hundred dense spaces points may build horizontal, vertical
or diagonal lines or rectangles. Additional there exist many randomly
distributed points.
I want to replace the point-paths by line segments, I need the endpoints
of these line segments. (The application is my topological PCB router,
see http://www.ssalewski.de/Router.html.en, the dense point paths are
obstacles, I need to calculate the detour...)
Can you recommend an algorithm? Starting with a Delaunay triangulation
may be an option, I think long time ago I have seen some path
reconstruction pictures for curved closed paths.
Best regards,
Stefan Salewski
- [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.