cgal-discuss - [cgal-discuss] Shortest distance path between two points in a simple polygon

Subject: CGAL users discussion list

List archive

[cgal-discuss] Shortest distance path between two points in a simple polygon

From: dg <>
To:
Subject: [cgal-discuss] Shortest distance path between two points in a simple polygon
Date: Tue, 29 Apr 2014 17:18:48 -0700 (PDT)

Hi all,

I want to find the shortest distance path between two points in a simple
polygon without holes.
Could anyone guide me if there exists such an algorithm implemented in CGAL
? The implementation might not be optimal, thats Ok.

I came across the Rubber-band algorithm research paper but couldnt find any
existing implementation in CGAL or elsewhere. Please help.

Thanks in advance.
dg.

--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Shortest-distance-path-between-two-points-in-a-simple-polygon-tp4659225.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

[cgal-discuss] Shortest distance path between two points in a simple polygon, dg, 04/30/2014
- Re: [cgal-discuss] Shortest distance path between two points in a simple polygon, Rémi Cura, 04/30/2014
  - Re: [cgal-discuss] Shortest distance path between two points in a simple polygon, Rémi Cura, 04/30/2014

List archive

[cgal-discuss] Shortest distance path between two points in a simple polygon