An implementation of Charles Karneys (March 2012) solution to the direct and inverse geodesic problems.
More...
|
| Geodesic (double a, double f) |
|
|
static double | SinCosSeries (bool sinp, double sinx, double cosx, double[] c, int n) |
|
static double | AngRound (double x) |
|
static double | Astroid (double x, double y) |
|
static double | A1m1f (double eps) |
|
static void | C1f (double eps, ref double[] c) |
|
static void | C1pf (double eps, ref double[] c) |
|
static double | A2m1f (double eps) |
|
static void | C2f (double eps, ref double[] c) |
|
|
const int | GEOGRAPHICLIB_GEODESIC_ORDER =6 |
|
const int | nA1_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nC1_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nC1p_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nA2_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nC2_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nA3_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nA3x_ =nA3_ |
|
const int | nC3_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nC3x_ =(nC3_*(nC3_-1))/2 |
|
const int | nC4_ =GEOGRAPHICLIB_GEODESIC_ORDER |
|
const int | nC4x_ =(nC4_*(nC4_+1))/2 |
|
const int | maxit1_ =20 |
|
const int | maxit2_ =maxit1_+Mathm.digits+10 |
|
static double | tiny_ =Math.Sqrt(double.Epsilon) |
|
static double | tol0_ =Mathm.epsilon |
|
static double | tol1_ =200*tol0_ |
|
static double | tol2_ =Math.Sqrt(tol0_) |
|
static double | tolb_ =tol0_*tol1_ |
|
static double | xthresh_ =1000*tol2_ |
|
const uint | CAP_NONE =0 |
|
const uint | CAP_C1 =1<<0 |
|
const uint | CAP_C1p =1<<1 |
|
const uint | CAP_C2 =1<<2 |
|
const uint | CAP_C3 =1<<3 |
|
const uint | CAP_C4 =1<<4 |
|
const uint | CAP_ALL =0x1F |
|
const uint | CAP_MASK =CAP_ALL |
|
const uint | OUT_ALL =0x7F80 |
|
const uint | OUT_MASK =0xFF80 |
|
const uint | NONE =0 |
|
const uint | LATITUDE =1<<7|CAP_NONE |
|
const uint | LONGITUDE =1<<8|CAP_C3 |
|
const uint | AZIMUTH =1<<9|CAP_NONE |
|
const uint | DISTANCE =1<<10|CAP_C1 |
|
const uint | DISTANCE_IN =1<<11|CAP_C1|CAP_C1p |
|
const uint | REDUCEDLENGTH =1<<12|CAP_C1|CAP_C2 |
|
const uint | GEODESICSCALE =1<<13|CAP_C1|CAP_C2 |
|
const uint | AREA =1<<14|CAP_C4 |
|
const uint | LONG_NOWRAP =1<<15 |
|
const uint | ALL =OUT_ALL|CAP_ALL |
|
|
double | A [get] |
|
double | F [get] |
|
double | F1 [get] |
|
double | E2 [get] |
|
double | Ep2 [get] |
|
double | B [get] |
|
double | C2 [get] |
|
An implementation of Charles Karneys (March 2012) solution to the direct and inverse geodesic problems.
The documentation for this class was generated from the following file:
- Src/Libraries/Teleplan.C4IS.Geo/Geodesics.cs