1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
|
/***********************************************************************
(Abridged) Molodensky Transform
Kristian Evers, 2017-07-07
************************************************************************
Implements the (abridged) Molodensky transformations for 2D and 3D
data.
Primarily useful for implementation of datum shifts in transformation
pipelines.
The code in this file is mostly based on
The Standard and Abridged Molodensky Coordinate Transformation
Formulae, 2004, R.E. Deaking,
http://www.mygeodesy.id.au/documents/Molodensky%20V2.pdf
************************************************************************
* Copyright (c) 2017, Kristian Evers / SDFE
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*
***********************************************************************/
#define PJ_LIB__
#include <errno.h>
#include <math.h>
#include "proj.h"
#include "proj_internal.h"
#include "projects.h"
PROJ_HEAD(molodensky, "Molodensky transform");
static PJ_XYZ forward_3d(PJ_LPZ lpz, PJ *P);
static PJ_LPZ reverse_3d(PJ_XYZ xyz, PJ *P);
namespace { // anonymous namespace
struct pj_opaque_molodensky {
double dx;
double dy;
double dz;
double da;
double df;
int abridged;
};
} // anonymous namespace
static double RN (double a, double es, double phi) {
/**********************************************************
N(phi) - prime vertical radius of curvature
-------------------------------------------
This is basically the same function as in PJ_cart.c
should probably be refactored into it's own file at some
point.
**********************************************************/
double s = sin(phi);
if (es==0)
return a;
return a / sqrt (1 - es*s*s);
}
static double RM (double a, double es, double phi) {
/**********************************************************
M(phi) - Meridian radius of curvature
-------------------------------------
Source:
E.J Krakiwsky & D.B. Thomson, 1974,
GEODETIC POSITION COMPUTATIONS,
Fredericton NB, Canada:
University of New Brunswick,
Department of Geodesy and Geomatics Engineering,
Lecture Notes No. 39,
99 pp.
http://www2.unb.ca/gge/Pubs/LN39.pdf
**********************************************************/
double s = sin(phi);
if (es==0)
return a;
/* eq. 13a */
if (phi == 0)
return a * (1-es);
/* eq. 13b */
if (fabs(phi) == M_PI_2)
return a / sqrt(1-es);
/* eq. 13 */
return (a * (1 - es) ) / pow(1 - es*s*s, 1.5);
}
static PJ_LPZ calc_standard_params(PJ_LPZ lpz, PJ *P) {
struct pj_opaque_molodensky *Q = (struct pj_opaque_molodensky *) P->opaque;
double dphi, dlam, dh;
/* sines and cosines */
double slam = sin(lpz.lam);
double clam = cos(lpz.lam);
double sphi = sin(lpz.phi);
double cphi = cos(lpz.phi);
/* ellipsoid parameters and differences */
double f = P->f, a = P->a;
double dx = Q->dx, dy = Q->dy, dz = Q->dz;
double da = Q->da, df = Q->df;
/* ellipsoid radii of curvature */
double rho = RM(a, P->es, lpz.phi);
double nu = RN(a, P->e2s, lpz.phi);
/* delta phi */
dphi = (-dx*sphi*clam) - (dy*sphi*slam) + (dz*cphi)
+ ((nu * P->es * sphi * cphi * da) / a)
+ (sphi*cphi * ( rho/(1-f) + nu*(1-f))*df);
dphi /= (rho + lpz.z);
/* delta lambda */
dlam = (-dx*slam + dy*clam) / ((nu+lpz.z)*cphi);
/* delta h */
dh = dx*cphi*clam + dy*cphi*slam + dz*sphi - (a/nu)*da + nu*(1-f)*sphi*sphi*df;
lpz.phi = dphi;
lpz.lam = dlam;
lpz.z = dh;
return lpz;
}
static PJ_LPZ calc_abridged_params(PJ_LPZ lpz, PJ *P) {
struct pj_opaque_molodensky *Q = (struct pj_opaque_molodensky *) P->opaque;
double dphi, dlam, dh;
/* sines and cosines */
double slam = sin(lpz.lam);
double clam = cos(lpz.lam);
double sphi = sin(lpz.phi);
double cphi = cos(lpz.phi);
/* ellipsoid parameters and differences */
double dx = Q->dx, dy = Q->dy, dz = Q->dz;
double da = Q->da, df = Q->df;
double adffda = (P->a*df + P->f*da);
/* delta phi */
dphi = -dx*sphi*clam - dy*sphi*slam + dz*cphi + adffda*sin(2*lpz.phi);
dphi /= RM(P->a, P->es, lpz.phi);
/* delta lambda */
dlam = -dx*slam + dy*clam;
dlam /= RN(P->a, P->e2s, lpz.phi)*cphi;
/* delta h */
dh = dx*cphi*clam + dy*cphi*slam + dz*sphi - da + adffda*sphi*sphi;
/* offset coordinate */
lpz.phi = dphi;
lpz.lam = dlam;
lpz.z = dh;
return lpz;
}
static PJ_XY forward_2d(PJ_LP lp, PJ *P) {
PJ_COORD point = {{0,0,0,0}};
point.lp = lp;
point.xyz = forward_3d(point.lpz, P);
return point.xy;
}
static PJ_LP reverse_2d(PJ_XY xy, PJ *P) {
PJ_COORD point = {{0,0,0,0}};
point.xy = xy;
point.xyz.z = 0;
point.lpz = reverse_3d(point.xyz, P);
return point.lp;
}
static PJ_XYZ forward_3d(PJ_LPZ lpz, PJ *P) {
struct pj_opaque_molodensky *Q = (struct pj_opaque_molodensky *) P->opaque;
PJ_COORD point = {{0,0,0,0}};
point.lpz = lpz;
/* calculate parameters depending on the mode we are in */
if (Q->abridged) {
lpz = calc_abridged_params(lpz, P);
} else {
lpz = calc_standard_params(lpz, P);
}
/* offset coordinate */
point.lpz.phi += lpz.phi;
point.lpz.lam += lpz.lam;
point.lpz.z += lpz.z;
return point.xyz;
}
static PJ_COORD forward_4d(PJ_COORD obs, PJ *P) {
obs.xyz = forward_3d(obs.lpz, P);
return obs;
}
static PJ_LPZ reverse_3d(PJ_XYZ xyz, PJ *P) {
struct pj_opaque_molodensky *Q = (struct pj_opaque_molodensky *) P->opaque;
PJ_COORD point = {{0,0,0,0}};
PJ_LPZ lpz;
/* calculate parameters depending on the mode we are in */
point.xyz = xyz;
if (Q->abridged)
lpz = calc_abridged_params(point.lpz, P);
else
lpz = calc_standard_params(point.lpz, P);
/* offset coordinate */
point.lpz.phi -= lpz.phi;
point.lpz.lam -= lpz.lam;
point.lpz.z -= lpz.z;
return point.lpz;
}
static PJ_COORD reverse_4d(PJ_COORD obs, PJ *P) {
obs.lpz = reverse_3d(obs.xyz, P);
return obs;
}
PJ *TRANSFORMATION(molodensky,1) {
int count_required_params = 0;
struct pj_opaque_molodensky *Q = static_cast<struct pj_opaque_molodensky*>(pj_calloc(1, sizeof(struct pj_opaque_molodensky)));
if (nullptr==Q)
return pj_default_destructor(P, ENOMEM);
P->opaque = (void *) Q;
P->fwd4d = forward_4d;
P->inv4d = reverse_4d;
P->fwd3d = forward_3d;
P->inv3d = reverse_3d;
P->fwd = forward_2d;
P->inv = reverse_2d;
P->left = PJ_IO_UNITS_ANGULAR;
P->right = PJ_IO_UNITS_ANGULAR;
/* read args */
if (pj_param(P->ctx, P->params, "tdx").i) {
count_required_params ++;
Q->dx = pj_param(P->ctx, P->params, "ddx").f;
}
if (pj_param(P->ctx, P->params, "tdy").i) {
count_required_params ++;
Q->dy = pj_param(P->ctx, P->params, "ddy").f;
}
if (pj_param(P->ctx, P->params, "tdz").i) {
count_required_params ++;
Q->dz = pj_param(P->ctx, P->params, "ddz").f;
}
if (pj_param(P->ctx, P->params, "tda").i) {
count_required_params ++;
Q->da = pj_param(P->ctx, P->params, "dda").f;
}
if (pj_param(P->ctx, P->params, "tdf").i) {
count_required_params ++;
Q->df = pj_param(P->ctx, P->params, "ddf").f;
}
Q->abridged = pj_param(P->ctx, P->params, "tabridged").i;
/* We want all parameters (except +abridged) to be set */
if (count_required_params == 0)
return pj_default_destructor(P, PJD_ERR_NO_ARGS);
if (count_required_params != 5)
return pj_default_destructor(P, PJD_ERR_MISSING_ARGS);
return P;
}
|