CGAL users discussion list

[shan23 <>]

I have a line *L* in the Euclidean plane and a scalar *D*, and I want to find
the 2 lines that are parallel to *L* and is at a distance of *D* from *L*.
How can I do that in CGAL?
The api /CGAL::parallel/ is for comparing if two lines/segments/rays are
parallel, not for returning a parallel line. The api /Line_2< Kernel >
perpendicular (const Point_2< Kernel > &p) const/ can be used to get the
equation of a line *N* normal to the line *L*, but I can't seem to find a
way to get the point at a distance *D* from *L* on the normal *N*. (If I can
get such a point *P*, I can generate the line parallel to *L* passing
through *P* to get my desired line equation).

Thoughts? I'm sure there is a way using some other API's, but I can't seem
to find it (I've looked pretty thoroughly through 2D and 3D Linear Geometry
Kernel API list, and have checked the APIs whose names sound promising).

Thanks - this is my first post here (though I've searched the forum before
posting).





--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Given-a-line-L-and-distance-D-in-R-2-how-to-find-equations-of-the-lines-parallel-to-L-at-distance-D--tp4661052.html
Sent from the cgal-discuss mailing list archive at Nabble.com.