GeographicLib  1.37
GeodesicExact.cpp
Go to the documentation of this file.
1 /**
2  * \file GeodesicExact.cpp
3  * \brief Implementation for GeographicLib::GeodesicExact class
4  *
5  * Copyright (c) Charles Karney (2012-2014) <charles@karney.com> and licensed
6  * under the MIT/X11 License. For more information, see
7  * http://geographiclib.sourceforge.net/
8  *
9  * This is a reformulation of the geodesic problem. The notation is as
10  * follows:
11  * - at a general point (no suffix or 1 or 2 as suffix)
12  * - phi = latitude
13  * - beta = latitude on auxiliary sphere
14  * - omega = longitude on auxiliary sphere
15  * - lambda = longitude
16  * - alpha = azimuth of great circle
17  * - sigma = arc length along great circle
18  * - s = distance
19  * - tau = scaled distance (= sigma at multiples of pi/2)
20  * - at northwards equator crossing
21  * - beta = phi = 0
22  * - omega = lambda = 0
23  * - alpha = alpha0
24  * - sigma = s = 0
25  * - a 12 suffix means a difference, e.g., s12 = s2 - s1.
26  * - s and c prefixes mean sin and cos
27  **********************************************************************/
28 
31 
32 #if defined(_MSC_VER)
33 // Squelch warnings about potentially uninitialized local variables and
34 // constant conditional expressions
35 # pragma warning (disable: 4701 4127)
36 #endif
37 
38 namespace GeographicLib {
39 
40  using namespace std;
41 
43  : maxit2_(maxit1_ + Math::digits() + 10)
44  // Underflow guard. We require
45  // tiny_ * epsilon() > 0
46  // tiny_ + epsilon() == epsilon()
47  , tiny_(sqrt(numeric_limits<real>::min()))
48  , tol0_(numeric_limits<real>::epsilon())
49  // Increase multiplier in defn of tol1_ from 100 to 200 to fix inverse
50  // case 52.784459512564 0 -52.784459512563990912 179.634407464943777557
51  // which otherwise failed for Visual Studio 10 (Release and Debug)
52  , tol1_(200 * tol0_)
53  , tol2_(sqrt(tol0_))
54  // Check on bisection interval
55  , tolb_(tol0_ * tol2_)
56  , xthresh_(1000 * tol2_)
57  , _a(a)
58  , _f(f <= 1 ? f : 1/f)
59  , _f1(1 - _f)
60  , _e2(_f * (2 - _f))
61  , _ep2(_e2 / Math::sq(_f1)) // e2 / (1 - e2)
62  , _n(_f / ( 2 - _f))
63  , _b(_a * _f1)
64  , _c2((Math::sq(_a) + Math::sq(_b) *
65  (_e2 == 0 ? 1 :
66  (_e2 > 0 ? Math::atanh(sqrt(_e2)) : atan(sqrt(-_e2))) /
67  sqrt(abs(_e2))))/2) // authalic radius squared
68  // The sig12 threshold for "really short". Using the auxiliary sphere
69  // solution with dnm computed at (bet1 + bet2) / 2, the relative error in
70  // the azimuth consistency check is sig12^2 * abs(f) * min(1, 1-f/2) / 2.
71  // (Error measured for 1/100 < b/a < 100 and abs(f) >= 1/1000. For a
72  // given f and sig12, the max error occurs for lines near the pole. If
73  // the old rule for computing dnm = (dn1 + dn2)/2 is used, then the error
74  // increases by a factor of 2.) Setting this equal to epsilon gives
75  // sig12 = etol2. Here 0.1 is a safety factor (error decreased by 100)
76  // and max(0.001, abs(f)) stops etol2 getting too large in the nearly
77  // spherical case.
78  , _etol2(0.1 * tol2_ /
79  sqrt( max(real(0.001), abs(_f)) * min(real(1), 1 - _f/2) / 2 ))
80  {
81  if (!(Math::isfinite(_a) && _a > 0))
82  throw GeographicErr("Major radius is not positive");
83  if (!(Math::isfinite(_b) && _b > 0))
84  throw GeographicErr("Minor radius is not positive");
85  C4coeff();
86  }
87 
89  static const GeodesicExact wgs84(Constants::WGS84_a(),
91  return wgs84;
92  }
93 
94  Math::real GeodesicExact::CosSeries(real sinx, real cosx,
95  const real c[], int n) {
96  // Evaluate
97  // y = sum(c[i] * cos((2*i+1) * x), i, 0, n-1)
98  // using Clenshaw summation.
99  // Approx operation count = (n + 5) mult and (2 * n + 2) add
100  c += n ; // Point to one beyond last element
101  real
102  ar = 2 * (cosx - sinx) * (cosx + sinx), // 2 * cos(2 * x)
103  y0 = n & 1 ? *--c : 0, y1 = 0; // accumulators for sum
104  // Now n is even
105  n /= 2;
106  while (n--) {
107  // Unroll loop x 2, so accumulators return to their original role
108  y1 = ar * y0 - y1 + *--c;
109  y0 = ar * y1 - y0 + *--c;
110  }
111  return cosx * (y0 - y1); // cos(x) * (y0 - y1)
112  }
113 
114  GeodesicLineExact GeodesicExact::Line(real lat1, real lon1, real azi1,
115  unsigned caps) const {
116  return GeodesicLineExact(*this, lat1, lon1, azi1, caps);
117  }
118 
119  Math::real GeodesicExact::GenDirect(real lat1, real lon1, real azi1,
120  bool arcmode, real s12_a12,
121  unsigned outmask,
122  real& lat2, real& lon2, real& azi2,
123  real& s12, real& m12,
124  real& M12, real& M21,
125  real& S12) const {
126  return GeodesicLineExact(*this, lat1, lon1, azi1,
127  // Automatically supply DISTANCE_IN if necessary
128  outmask | (arcmode ? NONE : DISTANCE_IN))
129  . // Note the dot!
130  GenPosition(arcmode, s12_a12, outmask,
131  lat2, lon2, azi2, s12, m12, M12, M21, S12);
132  }
133 
134  Math::real GeodesicExact::GenInverse(real lat1, real lon1,
135  real lat2, real lon2,
136  unsigned outmask,
137  real& s12, real& azi1, real& azi2,
138  real& m12, real& M12, real& M21,
139  real& S12) const {
140  outmask &= OUT_ALL;
141  // Compute longitude difference (AngDiff does this carefully). Result is
142  // in [-180, 180] but -180 is only for west-going geodesics. 180 is for
143  // east-going and meridional geodesics.
144  real lon12 = Math::AngDiff(Math::AngNormalize(lon1),
145  Math::AngNormalize(lon2));
146  // If very close to being on the same half-meridian, then make it so.
147  lon12 = AngRound(lon12);
148  // Make longitude difference positive.
149  int lonsign = lon12 >= 0 ? 1 : -1;
150  lon12 *= lonsign;
151  // If really close to the equator, treat as on equator.
152  lat1 = AngRound(lat1);
153  lat2 = AngRound(lat2);
154  // Swap points so that point with higher (abs) latitude is point 1
155  int swapp = abs(lat1) >= abs(lat2) ? 1 : -1;
156  if (swapp < 0) {
157  lonsign *= -1;
158  swap(lat1, lat2);
159  }
160  // Make lat1 <= 0
161  int latsign = lat1 < 0 ? 1 : -1;
162  lat1 *= latsign;
163  lat2 *= latsign;
164  // Now we have
165  //
166  // 0 <= lon12 <= 180
167  // -90 <= lat1 <= 0
168  // lat1 <= lat2 <= -lat1
169  //
170  // longsign, swapp, latsign register the transformation to bring the
171  // coordinates to this canonical form. In all cases, 1 means no change was
172  // made. We make these transformations so that there are few cases to
173  // check, e.g., on verifying quadrants in atan2. In addition, this
174  // enforces some symmetries in the results returned.
175 
176  real phi, sbet1, cbet1, sbet2, cbet2, s12x, m12x;
177  // Initialize for the meridian. No longitude calculation is done in this
178  // case to let the parameter default to 0.
179  EllipticFunction E(-_ep2);
180 
181  phi = lat1 * Math::degree();
182  // Ensure cbet1 = +epsilon at poles
183  sbet1 = _f1 * sin(phi);
184  cbet1 = lat1 == -90 ? tiny_ : cos(phi);
185  SinCosNorm(sbet1, cbet1);
186 
187  phi = lat2 * Math::degree();
188  // Ensure cbet2 = +epsilon at poles
189  sbet2 = _f1 * sin(phi);
190  cbet2 = abs(lat2) == 90 ? tiny_ : cos(phi);
191  SinCosNorm(sbet2, cbet2);
192 
193  // If cbet1 < -sbet1, then cbet2 - cbet1 is a sensitive measure of the
194  // |bet1| - |bet2|. Alternatively (cbet1 >= -sbet1), abs(sbet2) + sbet1 is
195  // a better measure. This logic is used in assigning calp2 in Lambda12.
196  // Sometimes these quantities vanish and in that case we force bet2 = +/-
197  // bet1 exactly. An example where is is necessary is the inverse problem
198  // 48.522876735459 0 -48.52287673545898293 179.599720456223079643
199  // which failed with Visual Studio 10 (Release and Debug)
200 
201  if (cbet1 < -sbet1) {
202  if (cbet2 == cbet1)
203  sbet2 = sbet2 < 0 ? sbet1 : -sbet1;
204  } else {
205  if (abs(sbet2) == -sbet1)
206  cbet2 = cbet1;
207  }
208 
209  real
210  dn1 = (_f >= 0 ? sqrt(1 + _ep2 * Math::sq(sbet1)) :
211  sqrt(1 - _e2 * Math::sq(cbet1)) / _f1),
212  dn2 = (_f >= 0 ? sqrt(1 + _ep2 * Math::sq(sbet2)) :
213  sqrt(1 - _e2 * Math::sq(cbet2)) / _f1);
214 
215  real
216  lam12 = lon12 * Math::degree(),
217  slam12 = abs(lon12) == 180 ? 0 : sin(lam12),
218  clam12 = cos(lam12); // lon12 == 90 isn't interesting
219 
220  real a12, sig12, calp1, salp1, calp2, salp2;
221 
222  bool meridian = lat1 == -90 || slam12 == 0;
223 
224  if (meridian) {
225 
226  // Endpoints are on a single full meridian, so the geodesic might lie on
227  // a meridian.
228 
229  calp1 = clam12; salp1 = slam12; // Head to the target longitude
230  calp2 = 1; salp2 = 0; // At the target we're heading north
231 
232  real
233  // tan(bet) = tan(sig) * cos(alp)
234  ssig1 = sbet1, csig1 = calp1 * cbet1,
235  ssig2 = sbet2, csig2 = calp2 * cbet2;
236 
237  // sig12 = sig2 - sig1
238  sig12 = atan2(max(csig1 * ssig2 - ssig1 * csig2, real(0)),
239  csig1 * csig2 + ssig1 * ssig2);
240  {
241  real dummy;
242  Lengths(E, sig12, ssig1, csig1, dn1, ssig2, csig2, dn2,
243  cbet1, cbet2, s12x, m12x, dummy,
244  (outmask & GEODESICSCALE) != 0U, M12, M21);
245  }
246  // Add the check for sig12 since zero length geodesics might yield m12 <
247  // 0. Test case was
248  //
249  // echo 20.001 0 20.001 0 | GeodSolve -i
250  //
251  // In fact, we will have sig12 > pi/2 for meridional geodesic which is
252  // not a shortest path.
253  if (sig12 < 1 || m12x >= 0) {
254  m12x *= _b;
255  s12x *= _b;
256  a12 = sig12 / Math::degree();
257  } else
258  // m12 < 0, i.e., prolate and too close to anti-podal
259  meridian = false;
260  }
261 
262  real omg12;
263  if (!meridian &&
264  sbet1 == 0 && // and sbet2 == 0
265  // Mimic the way Lambda12 works with calp1 = 0
266  (_f <= 0 || lam12 <= Math::pi() - _f * Math::pi())) {
267 
268  // Geodesic runs along equator
269  calp1 = calp2 = 0; salp1 = salp2 = 1;
270  s12x = _a * lam12;
271  sig12 = omg12 = lam12 / _f1;
272  m12x = _b * sin(sig12);
273  if (outmask & GEODESICSCALE)
274  M12 = M21 = cos(sig12);
275  a12 = lon12 / _f1;
276 
277  } else if (!meridian) {
278 
279  // Now point1 and point2 belong within a hemisphere bounded by a
280  // meridian and geodesic is neither meridional or equatorial.
281 
282  // Figure a starting point for Newton's method
283  real dnm;
284  sig12 = InverseStart(E, sbet1, cbet1, dn1, sbet2, cbet2, dn2,
285  lam12,
286  salp1, calp1, salp2, calp2, dnm);
287 
288  if (sig12 >= 0) {
289  // Short lines (InverseStart sets salp2, calp2, dnm)
290  s12x = sig12 * _b * dnm;
291  m12x = Math::sq(dnm) * _b * sin(sig12 / dnm);
292  if (outmask & GEODESICSCALE)
293  M12 = M21 = cos(sig12 / dnm);
294  a12 = sig12 / Math::degree();
295  omg12 = lam12 / (_f1 * dnm);
296  } else {
297 
298  // Newton's method. This is a straightforward solution of f(alp1) =
299  // lambda12(alp1) - lam12 = 0 with one wrinkle. f(alp) has exactly one
300  // root in the interval (0, pi) and its derivative is positive at the
301  // root. Thus f(alp) is positive for alp > alp1 and negative for alp <
302  // alp1. During the course of the iteration, a range (alp1a, alp1b) is
303  // maintained which brackets the root and with each evaluation of
304  // f(alp) the range is shrunk, if possible. Newton's method is
305  // restarted whenever the derivative of f is negative (because the new
306  // value of alp1 is then further from the solution) or if the new
307  // estimate of alp1 lies outside (0,pi); in this case, the new starting
308  // guess is taken to be (alp1a + alp1b) / 2.
309  real ssig1, csig1, ssig2, csig2;
310  unsigned numit = 0;
311  // Bracketing range
312  real salp1a = tiny_, calp1a = 1, salp1b = tiny_, calp1b = -1;
313  for (bool tripn = false, tripb = false;
314  numit < maxit2_ || GEOGRAPHICLIB_PANIC;
315  ++numit) {
316  // 1/4 meridan = 10e6 m and random input. max err is estimated max
317  // error in nm (checking solution of inverse problem by direct
318  // solution). iter is mean and sd of number of iterations
319  //
320  // max iter
321  // log2(b/a) err mean sd
322  // -7 387 5.33 3.68
323  // -6 345 5.19 3.43
324  // -5 269 5.00 3.05
325  // -4 210 4.76 2.44
326  // -3 115 4.55 1.87
327  // -2 69 4.35 1.38
328  // -1 36 4.05 1.03
329  // 0 15 0.01 0.13
330  // 1 25 5.10 1.53
331  // 2 96 5.61 2.09
332  // 3 318 6.02 2.74
333  // 4 985 6.24 3.22
334  // 5 2352 6.32 3.44
335  // 6 6008 6.30 3.45
336  // 7 19024 6.19 3.30
337  real dv;
338  real v = Lambda12(sbet1, cbet1, dn1, sbet2, cbet2, dn2, salp1, calp1,
339  salp2, calp2, sig12, ssig1, csig1, ssig2, csig2,
340  E, omg12, numit < maxit1_, dv) - lam12;
341  // 2 * tol0 is approximately 1 ulp for a number in [0, pi].
342  // Reversed test to allow escape with NaNs
343  if (tripb || !(abs(v) >= (tripn ? 8 : 2) * tol0_)) break;
344  // Update bracketing values
345  if (v > 0 && (numit > maxit1_ || calp1/salp1 > calp1b/salp1b))
346  { salp1b = salp1; calp1b = calp1; }
347  else if (v < 0 && (numit > maxit1_ || calp1/salp1 < calp1a/salp1a))
348  { salp1a = salp1; calp1a = calp1; }
349  if (numit < maxit1_ && dv > 0) {
350  real
351  dalp1 = -v/dv;
352  real
353  sdalp1 = sin(dalp1), cdalp1 = cos(dalp1),
354  nsalp1 = salp1 * cdalp1 + calp1 * sdalp1;
355  if (nsalp1 > 0 && abs(dalp1) < Math::pi()) {
356  calp1 = calp1 * cdalp1 - salp1 * sdalp1;
357  salp1 = nsalp1;
358  SinCosNorm(salp1, calp1);
359  // In some regimes we don't get quadratic convergence because
360  // slope -> 0. So use convergence conditions based on epsilon
361  // instead of sqrt(epsilon).
362  tripn = abs(v) <= 16 * tol0_;
363  continue;
364  }
365  }
366  // Either dv was not postive or updated value was outside legal
367  // range. Use the midpoint of the bracket as the next estimate.
368  // This mechanism is not needed for the WGS84 ellipsoid, but it does
369  // catch problems with more eccentric ellipsoids. Its efficacy is
370  // such for the WGS84 test set with the starting guess set to alp1 =
371  // 90deg:
372  // the WGS84 test set: mean = 5.21, sd = 3.93, max = 24
373  // WGS84 and random input: mean = 4.74, sd = 0.99
374  salp1 = (salp1a + salp1b)/2;
375  calp1 = (calp1a + calp1b)/2;
376  SinCosNorm(salp1, calp1);
377  tripn = false;
378  tripb = (abs(salp1a - salp1) + (calp1a - calp1) < tolb_ ||
379  abs(salp1 - salp1b) + (calp1 - calp1b) < tolb_);
380  }
381  {
382  real dummy;
383  Lengths(E, sig12, ssig1, csig1, dn1, ssig2, csig2, dn2,
384  cbet1, cbet2, s12x, m12x, dummy,
385  (outmask & GEODESICSCALE) != 0U, M12, M21);
386  }
387  m12x *= _b;
388  s12x *= _b;
389  a12 = sig12 / Math::degree();
390  }
391  }
392 
393  if (outmask & DISTANCE)
394  s12 = 0 + s12x; // Convert -0 to 0
395 
396  if (outmask & REDUCEDLENGTH)
397  m12 = 0 + m12x; // Convert -0 to 0
398 
399  if (outmask & AREA) {
400  real
401  // From Lambda12: sin(alp1) * cos(bet1) = sin(alp0)
402  salp0 = salp1 * cbet1,
403  calp0 = Math::hypot(calp1, salp1 * sbet1); // calp0 > 0
404  real alp12;
405  if (calp0 != 0 && salp0 != 0) {
406  real
407  // From Lambda12: tan(bet) = tan(sig) * cos(alp)
408  ssig1 = sbet1, csig1 = calp1 * cbet1,
409  ssig2 = sbet2, csig2 = calp2 * cbet2,
410  k2 = Math::sq(calp0) * _ep2,
411  eps = k2 / (2 * (1 + sqrt(1 + k2)) + k2),
412  // Multiplier = a^2 * e^2 * cos(alpha0) * sin(alpha0).
413  A4 = Math::sq(_a) * calp0 * salp0 * _e2;
414  SinCosNorm(ssig1, csig1);
415  SinCosNorm(ssig2, csig2);
416  real C4a[nC4_];
417  C4f(eps, C4a);
418  real
419  B41 = CosSeries(ssig1, csig1, C4a, nC4_),
420  B42 = CosSeries(ssig2, csig2, C4a, nC4_);
421  S12 = A4 * (B42 - B41);
422  } else
423  // Avoid problems with indeterminate sig1, sig2 on equator
424  S12 = 0;
425 
426  if (!meridian &&
427  omg12 < real(0.75) * Math::pi() && // Long difference too big
428  sbet2 - sbet1 < real(1.75)) { // Lat difference too big
429  // Use tan(Gamma/2) = tan(omg12/2)
430  // * (tan(bet1/2)+tan(bet2/2))/(1+tan(bet1/2)*tan(bet2/2))
431  // with tan(x/2) = sin(x)/(1+cos(x))
432  real
433  somg12 = sin(omg12), domg12 = 1 + cos(omg12),
434  dbet1 = 1 + cbet1, dbet2 = 1 + cbet2;
435  alp12 = 2 * atan2( somg12 * ( sbet1 * dbet2 + sbet2 * dbet1 ),
436  domg12 * ( sbet1 * sbet2 + dbet1 * dbet2 ) );
437  } else {
438  // alp12 = alp2 - alp1, used in atan2 so no need to normalize
439  real
440  salp12 = salp2 * calp1 - calp2 * salp1,
441  calp12 = calp2 * calp1 + salp2 * salp1;
442  // The right thing appears to happen if alp1 = +/-180 and alp2 = 0, viz
443  // salp12 = -0 and alp12 = -180. However this depends on the sign
444  // being attached to 0 correctly. The following ensures the correct
445  // behavior.
446  if (salp12 == 0 && calp12 < 0) {
447  salp12 = tiny_ * calp1;
448  calp12 = -1;
449  }
450  alp12 = atan2(salp12, calp12);
451  }
452  S12 += _c2 * alp12;
453  S12 *= swapp * lonsign * latsign;
454  // Convert -0 to 0
455  S12 += 0;
456  }
457 
458  // Convert calp, salp to azimuth accounting for lonsign, swapp, latsign.
459  if (swapp < 0) {
460  swap(salp1, salp2);
461  swap(calp1, calp2);
462  if (outmask & GEODESICSCALE)
463  swap(M12, M21);
464  }
465 
466  salp1 *= swapp * lonsign; calp1 *= swapp * latsign;
467  salp2 *= swapp * lonsign; calp2 *= swapp * latsign;
468 
469  if (outmask & AZIMUTH) {
470  // minus signs give range [-180, 180). 0- converts -0 to +0.
471  azi1 = 0 - atan2(-salp1, calp1) / Math::degree();
472  azi2 = 0 - atan2(-salp2, calp2) / Math::degree();
473  }
474 
475  // Returned value in [0, 180]
476  return a12;
477  }
478 
479  void GeodesicExact::Lengths(const EllipticFunction& E,
480  real sig12,
481  real ssig1, real csig1, real dn1,
482  real ssig2, real csig2, real dn2,
483  real cbet1, real cbet2,
484  real& s12b, real& m12b, real& m0,
485  bool scalep, real& M12, real& M21) const {
486  // Return m12b = (reduced length)/_b; also calculate s12b = distance/_b,
487  // and m0 = coefficient of secular term in expression for reduced length.
488 
489  // It's OK to have repeated dummy arguments,
490  // e.g., s12b = m0 = M12 = M21 = dummy
491  m0 = - E.k2() * E.D() / (Math::pi() / 2);
492  real J12 = m0 *
493  (sig12 + E.deltaD(ssig2, csig2, dn2) - E.deltaD(ssig1, csig1, dn1));
494  // Missing a factor of _b.
495  // Add parens around (csig1 * ssig2) and (ssig1 * csig2) to ensure accurate
496  // cancellation in the case of coincident points.
497  m12b = dn2 * (csig1 * ssig2) - dn1 * (ssig1 * csig2) - csig1 * csig2 * J12;
498  // Missing a factor of _b
499  s12b = E.E() / (Math::pi() / 2) *
500  (sig12 + E.deltaE(ssig2, csig2, dn2) - E.deltaE(ssig1, csig1, dn1));
501  if (scalep) {
502  real csig12 = csig1 * csig2 + ssig1 * ssig2;
503  real t = _ep2 * (cbet1 - cbet2) * (cbet1 + cbet2) / (dn1 + dn2);
504  M12 = csig12 + (t * ssig2 - csig2 * J12) * ssig1 / dn1;
505  M21 = csig12 - (t * ssig1 - csig1 * J12) * ssig2 / dn2;
506  }
507  }
508 
509  Math::real GeodesicExact::Astroid(real x, real y) {
510  // Solve k^4+2*k^3-(x^2+y^2-1)*k^2-2*y^2*k-y^2 = 0 for positive root k.
511  // This solution is adapted from Geocentric::Reverse.
512  real k;
513  real
514  p = Math::sq(x),
515  q = Math::sq(y),
516  r = (p + q - 1) / 6;
517  if ( !(q == 0 && r <= 0) ) {
518  real
519  // Avoid possible division by zero when r = 0 by multiplying equations
520  // for s and t by r^3 and r, resp.
521  S = p * q / 4, // S = r^3 * s
522  r2 = Math::sq(r),
523  r3 = r * r2,
524  // The discrimant of the quadratic equation for T3. This is zero on
525  // the evolute curve p^(1/3)+q^(1/3) = 1
526  disc = S * (S + 2 * r3);
527  real u = r;
528  if (disc >= 0) {
529  real T3 = S + r3;
530  // Pick the sign on the sqrt to maximize abs(T3). This minimizes loss
531  // of precision due to cancellation. The result is unchanged because
532  // of the way the T is used in definition of u.
533  T3 += T3 < 0 ? -sqrt(disc) : sqrt(disc); // T3 = (r * t)^3
534  // N.B. cbrt always returns the real root. cbrt(-8) = -2.
535  real T = Math::cbrt(T3); // T = r * t
536  // T can be zero; but then r2 / T -> 0.
537  u += T + (T ? r2 / T : 0);
538  } else {
539  // T is complex, but the way u is defined the result is real.
540  real ang = atan2(sqrt(-disc), -(S + r3));
541  // There are three possible cube roots. We choose the root which
542  // avoids cancellation. Note that disc < 0 implies that r < 0.
543  u += 2 * r * cos(ang / 3);
544  }
545  real
546  v = sqrt(Math::sq(u) + q), // guaranteed positive
547  // Avoid loss of accuracy when u < 0.
548  uv = u < 0 ? q / (v - u) : u + v, // u+v, guaranteed positive
549  w = (uv - q) / (2 * v); // positive?
550  // Rearrange expression for k to avoid loss of accuracy due to
551  // subtraction. Division by 0 not possible because uv > 0, w >= 0.
552  k = uv / (sqrt(uv + Math::sq(w)) + w); // guaranteed positive
553  } else { // q == 0 && r <= 0
554  // y = 0 with |x| <= 1. Handle this case directly.
555  // for y small, positive root is k = abs(y)/sqrt(1-x^2)
556  k = 0;
557  }
558  return k;
559  }
560 
561  Math::real GeodesicExact::InverseStart(EllipticFunction& E,
562  real sbet1, real cbet1, real dn1,
563  real sbet2, real cbet2, real dn2,
564  real lam12,
565  real& salp1, real& calp1,
566  // Only updated if return val >= 0
567  real& salp2, real& calp2,
568  // Only updated for short lines
569  real& dnm)
570  const {
571  // Return a starting point for Newton's method in salp1 and calp1 (function
572  // value is -1). If Newton's method doesn't need to be used, return also
573  // salp2 and calp2 and function value is sig12.
574  real
575  sig12 = -1, // Return value
576  // bet12 = bet2 - bet1 in [0, pi); bet12a = bet2 + bet1 in (-pi, 0]
577  sbet12 = sbet2 * cbet1 - cbet2 * sbet1,
578  cbet12 = cbet2 * cbet1 + sbet2 * sbet1;
579 #if defined(__GNUC__) && __GNUC__ == 4 && \
580  (__GNUC_MINOR__ < 6 || defined(__MINGW32__))
581  // Volatile declaration needed to fix inverse cases
582  // 88.202499451857 0 -88.202499451857 179.981022032992859592
583  // 89.262080389218 0 -89.262080389218 179.992207982775375662
584  // 89.333123580033 0 -89.333123580032997687 179.99295812360148422
585  // which otherwise fail with g++ 4.4.4 x86 -O3 (Linux)
586  // and g++ 4.4.0 (mingw) and g++ 4.6.1 (tdm mingw).
587  real sbet12a;
588  {
589  GEOGRAPHICLIB_VOLATILE real xx1 = sbet2 * cbet1;
590  GEOGRAPHICLIB_VOLATILE real xx2 = cbet2 * sbet1;
591  sbet12a = xx1 + xx2;
592  }
593 #else
594  real sbet12a = sbet2 * cbet1 + cbet2 * sbet1;
595 #endif
596  bool shortline = cbet12 >= 0 && sbet12 < real(0.5) &&
597  cbet2 * lam12 < real(0.5);
598  real omg12 = lam12;
599  if (shortline) {
600  real sbetm2 = Math::sq(sbet1 + sbet2);
601  // sin((bet1+bet2)/2)^2
602  // = (sbet1 + sbet2)^2 / ((sbet1 + sbet2)^2 + (cbet1 + cbet2)^2)
603  sbetm2 /= sbetm2 + Math::sq(cbet1 + cbet2);
604  dnm = sqrt(1 + _ep2 * sbetm2);
605  omg12 /= _f1 * dnm;
606  }
607  real somg12 = sin(omg12), comg12 = cos(omg12);
608 
609  salp1 = cbet2 * somg12;
610  calp1 = comg12 >= 0 ?
611  sbet12 + cbet2 * sbet1 * Math::sq(somg12) / (1 + comg12) :
612  sbet12a - cbet2 * sbet1 * Math::sq(somg12) / (1 - comg12);
613 
614  real
615  ssig12 = Math::hypot(salp1, calp1),
616  csig12 = sbet1 * sbet2 + cbet1 * cbet2 * comg12;
617 
618  if (shortline && ssig12 < _etol2) {
619  // really short lines
620  salp2 = cbet1 * somg12;
621  calp2 = sbet12 - cbet1 * sbet2 *
622  (comg12 >= 0 ? Math::sq(somg12) / (1 + comg12) : 1 - comg12);
623  SinCosNorm(salp2, calp2);
624  // Set return value
625  sig12 = atan2(ssig12, csig12);
626  } else if (abs(_n) > real(0.1) || // Skip astroid calc if too eccentric
627  csig12 >= 0 ||
628  ssig12 >= 6 * abs(_n) * Math::pi() * Math::sq(cbet1)) {
629  // Nothing to do, zeroth order spherical approximation is OK
630  } else {
631  // Scale lam12 and bet2 to x, y coordinate system where antipodal point
632  // is at origin and singular point is at y = 0, x = -1.
633  real y, lamscale, betscale;
634  // Volatile declaration needed to fix inverse case
635  // 56.320923501171 0 -56.320923501171 179.664747671772880215
636  // which otherwise fails with g++ 4.4.4 x86 -O3
638  if (_f >= 0) { // In fact f == 0 does not get here
639  // x = dlong, y = dlat
640  {
641  real k2 = Math::sq(sbet1) * _ep2;
642  E.Reset(-k2, -_ep2, 1 + k2, 1 + _ep2);
643  lamscale = _e2/_f1 * cbet1 * 2 * E.H();
644  }
645  betscale = lamscale * cbet1;
646 
647  x = (lam12 - Math::pi()) / lamscale;
648  y = sbet12a / betscale;
649  } else { // _f < 0
650  // x = dlat, y = dlong
651  real
652  cbet12a = cbet2 * cbet1 - sbet2 * sbet1,
653  bet12a = atan2(sbet12a, cbet12a);
654  real m12b, m0, dummy;
655  // In the case of lon12 = 180, this repeats a calculation made in
656  // Inverse.
657  Lengths(E, Math::pi() + bet12a,
658  sbet1, -cbet1, dn1, sbet2, cbet2, dn2,
659  cbet1, cbet2, dummy, m12b, m0, false,
660  dummy, dummy);
661  x = -1 + m12b / (cbet1 * cbet2 * m0 * Math::pi());
662  betscale = x < -real(0.01) ? sbet12a / x :
663  -_f * Math::sq(cbet1) * Math::pi();
664  lamscale = betscale / cbet1;
665  y = (lam12 - Math::pi()) / lamscale;
666  }
667 
668  if (y > -tol1_ && x > -1 - xthresh_) {
669  // strip near cut
670  // Need real(x) here to cast away the volatility of x for min/max
671  if (_f >= 0) {
672  salp1 = min(real(1), -real(x)); calp1 = - sqrt(1 - Math::sq(salp1));
673  } else {
674  calp1 = max(real(x > -tol1_ ? 0 : -1), real(x));
675  salp1 = sqrt(1 - Math::sq(calp1));
676  }
677  } else {
678  // Estimate alp1, by solving the astroid problem.
679  //
680  // Could estimate alpha1 = theta + pi/2, directly, i.e.,
681  // calp1 = y/k; salp1 = -x/(1+k); for _f >= 0
682  // calp1 = x/(1+k); salp1 = -y/k; for _f < 0 (need to check)
683  //
684  // However, it's better to estimate omg12 from astroid and use
685  // spherical formula to compute alp1. This reduces the mean number of
686  // Newton iterations for astroid cases from 2.24 (min 0, max 6) to 2.12
687  // (min 0 max 5). The changes in the number of iterations are as
688  // follows:
689  //
690  // change percent
691  // 1 5
692  // 0 78
693  // -1 16
694  // -2 0.6
695  // -3 0.04
696  // -4 0.002
697  //
698  // The histogram of iterations is (m = number of iterations estimating
699  // alp1 directly, n = number of iterations estimating via omg12, total
700  // number of trials = 148605):
701  //
702  // iter m n
703  // 0 148 186
704  // 1 13046 13845
705  // 2 93315 102225
706  // 3 36189 32341
707  // 4 5396 7
708  // 5 455 1
709  // 6 56 0
710  //
711  // Because omg12 is near pi, estimate work with omg12a = pi - omg12
712  real k = Astroid(x, y);
713  real
714  omg12a = lamscale * ( _f >= 0 ? -x * k/(1 + k) : -y * (1 + k)/k );
715  somg12 = sin(omg12a); comg12 = -cos(omg12a);
716  // Update spherical estimate of alp1 using omg12 instead of lam12
717  salp1 = cbet2 * somg12;
718  calp1 = sbet12a - cbet2 * sbet1 * Math::sq(somg12) / (1 - comg12);
719  }
720  }
721  if (salp1 > 0) // Sanity check on starting guess
722  SinCosNorm(salp1, calp1);
723  else {
724  salp1 = 1; calp1 = 0;
725  }
726  return sig12;
727  }
728 
729  Math::real GeodesicExact::Lambda12(real sbet1, real cbet1, real dn1,
730  real sbet2, real cbet2, real dn2,
731  real salp1, real calp1,
732  real& salp2, real& calp2,
733  real& sig12,
734  real& ssig1, real& csig1,
735  real& ssig2, real& csig2,
736  EllipticFunction& E,
737  real& omg12,
738  bool diffp, real& dlam12) const
739  {
740 
741  if (sbet1 == 0 && calp1 == 0)
742  // Break degeneracy of equatorial line. This case has already been
743  // handled.
744  calp1 = -tiny_;
745 
746  real
747  // sin(alp1) * cos(bet1) = sin(alp0)
748  salp0 = salp1 * cbet1,
749  calp0 = Math::hypot(calp1, salp1 * sbet1); // calp0 > 0
750 
751  real somg1, comg1, somg2, comg2, cchi1, cchi2, lam12;
752  // tan(bet1) = tan(sig1) * cos(alp1)
753  // tan(omg1) = sin(alp0) * tan(sig1) = tan(omg1)=tan(alp1)*sin(bet1)
754  ssig1 = sbet1; somg1 = salp0 * sbet1;
755  csig1 = comg1 = calp1 * cbet1;
756  // Without normalization we have schi1 = somg1.
757  cchi1 = _f1 * dn1 * comg1;
758  SinCosNorm(ssig1, csig1);
759  // SinCosNorm(somg1, comg1); -- don't need to normalize!
760  // SinCosNorm(schi1, cchi1); -- don't need to normalize!
761 
762  // Enforce symmetries in the case abs(bet2) = -bet1. Need to be careful
763  // about this case, since this can yield singularities in the Newton
764  // iteration.
765  // sin(alp2) * cos(bet2) = sin(alp0)
766  salp2 = cbet2 != cbet1 ? salp0 / cbet2 : salp1;
767  // calp2 = sqrt(1 - sq(salp2))
768  // = sqrt(sq(calp0) - sq(sbet2)) / cbet2
769  // and subst for calp0 and rearrange to give (choose positive sqrt
770  // to give alp2 in [0, pi/2]).
771  calp2 = cbet2 != cbet1 || abs(sbet2) != -sbet1 ?
772  sqrt(Math::sq(calp1 * cbet1) +
773  (cbet1 < -sbet1 ?
774  (cbet2 - cbet1) * (cbet1 + cbet2) :
775  (sbet1 - sbet2) * (sbet1 + sbet2))) / cbet2 :
776  abs(calp1);
777  // tan(bet2) = tan(sig2) * cos(alp2)
778  // tan(omg2) = sin(alp0) * tan(sig2).
779  ssig2 = sbet2; somg2 = salp0 * sbet2;
780  csig2 = comg2 = calp2 * cbet2;
781  // Without normalization we have schi2 = somg2.
782  cchi2 = _f1 * dn2 * comg2;
783  SinCosNorm(ssig2, csig2);
784  // SinCosNorm(somg2, comg2); -- don't need to normalize!
785  // SinCosNorm(schi2, cchi2); -- don't need to normalize!
786 
787  // sig12 = sig2 - sig1, limit to [0, pi]
788  sig12 = atan2(max(csig1 * ssig2 - ssig1 * csig2, real(0)),
789  csig1 * csig2 + ssig1 * ssig2);
790 
791  // omg12 = omg2 - omg1, limit to [0, pi]
792  omg12 = atan2(max(comg1 * somg2 - somg1 * comg2, real(0)),
793  comg1 * comg2 + somg1 * somg2);
794  real k2 = Math::sq(calp0) * _ep2;
795  E.Reset(-k2, -_ep2, 1 + k2, 1 + _ep2);
796  real chi12 = atan2(max(cchi1 * somg2 - somg1 * cchi2, real(0)),
797  cchi1 * cchi2 + somg1 * somg2);
798  lam12 = chi12 -
799  _e2/_f1 * salp0 * E.H() / (Math::pi() / 2) *
800  (sig12 + E.deltaH(ssig2, csig2, dn2) - E.deltaH(ssig1, csig1, dn1) );
801 
802  if (diffp) {
803  if (calp2 == 0)
804  dlam12 = - 2 * _f1 * dn1 / sbet1;
805  else {
806  real dummy;
807  Lengths(E, sig12, ssig1, csig1, dn1, ssig2, csig2, dn2,
808  cbet1, cbet2, dummy, dlam12, dummy,
809  false, dummy, dummy);
810  dlam12 *= _f1 / (calp2 * cbet2);
811  }
812  }
813 
814  return lam12;
815  }
816 
817  void GeodesicExact::C4f(real eps, real c[]) const {
818  // Evaluate C4 coeffs by Horner's method
819  // Elements c[0] thru c[nC4_ - 1] are set
820  for (int j = nC4x_, k = nC4_; k; ) {
821  real t = 0;
822  for (int i = nC4_ - k + 1; i; --i)
823  t = eps * t + _C4x[--j];
824  c[--k] = t;
825  }
826 
827  real mult = 1;
828  for (int k = 1; k < nC4_; ) {
829  mult *= eps;
830  c[k++] *= mult;
831  }
832  }
833 
834  // Geodesic.cpp contains explicit expressions for _C4x[l]. However this
835  // results in extraordinarily long compiler times with real = quad (7 mins)
836  // or mpreal (15 mins). So instead we evaluate _C4x[l] by using the Horner
837  // recursion with the coefficient stored in an array by rawC4coeff.
838 
839  void GeodesicExact::C4coeff() {
840  const real* cc = rawC4coeff();
841  // Coefficients for C[4,m]
842  for (int m = 0, k = 0, h = 0; m < nC4_; ++m) {
843  // eps^j coefficient
844  for (int j = m; j < nC4_; ++j) {
845  real t = 0;
846  // n^l coefficient
847  for (int l = nC4_ - j; l--;)
848  t = _n * t + cc[h++];
849  _C4x[k++] = t/cc[h++];
850  }
851  }
852  return;
853  }
854 
855 } // namespace GeographicLib
static T AngNormalize(T x)
Definition: Math.hpp:399
static T pi()
Definition: Math.hpp:213
GeographicLib::Math::real real
Definition: GeodSolve.cpp:40
static T cbrt(T x)
Definition: Math.hpp:356
static bool isfinite(T x)
Definition: Math.hpp:445
Mathematical functions needed by GeographicLib.
Definition: Math.hpp:101
Elliptic integrals and functions.
#define GEOGRAPHICLIB_VOLATILE
Definition: Math.hpp:83
Math::real GenInverse(real lat1, real lon1, real lat2, real lon2, unsigned outmask, real &s12, real &azi1, real &azi2, real &m12, real &M12, real &M21, real &S12) const
static T hypot(T x, T y)
Definition: Math.hpp:254
static T sq(T x)
Definition: Math.hpp:243
GeodesicLineExact Line(real lat1, real lon1, real azi1, unsigned caps=ALL) const
Header for GeographicLib::GeodesicLineExact class.
Namespace for GeographicLib.
Definition: Accumulator.cpp:12
static T degree()
Definition: Math.hpp:227
static T AngDiff(T x, T y)
Definition: Math.hpp:429
Math::real GenDirect(real lat1, real lon1, real azi1, bool arcmode, real s12_a12, unsigned outmask, real &lat2, real &lon2, real &azi2, real &s12, real &m12, real &M12, real &M21, real &S12) const
Exact geodesic calculations.
Math::real deltaE(real sn, real cn, real dn) const
Header for GeographicLib::GeodesicExact class.
Exception handling for GeographicLib.
Definition: Constants.hpp:362
Math::real deltaD(real sn, real cn, real dn) const
#define GEOGRAPHICLIB_PANIC
Definition: Math.hpp:86
static const GeodesicExact & WGS84()