static bool direct(const SGGeod& p1, double course1,
double distance, SGGeod& p2, double& course2);
+ /// overloaded version of above, returns new value directly, throws
+ /// an sg_exception on failure.
+ static SGGeod direct(const SGGeod& p1, double course1,
+ double distance);
+
static bool inverse(const SGGeod& p1, const SGGeod& p2, double& course1,
double& course2, double& distance);
static void advanceRadM(const SGGeoc& geoc, double course, double distance,
SGGeoc& result);
static double courseRad(const SGGeoc& from, const SGGeoc& to);
+ static double distanceRad(const SGGeoc& from, const SGGeoc& to);
static double distanceM(const SGGeoc& from, const SGGeoc& to);
+
+ /**
+ * compute the intersection of two (true) radials (in degrees), or return false
+ * if no intersection culd be computed.
+ */
+ static bool radialIntersection(const SGGeoc& a, double aRadial,
+ const SGGeoc& b, double bRadial, SGGeoc& result);
+
+ static bool radialIntersection(const SGGeod& a, double aRadial,
+ const SGGeod& b, double bRadial, SGGeod& result);
};
#endif