forked from MapServer/MapServer
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mapproject.c
1230 lines (1017 loc) · 40.3 KB
/
mapproject.c
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
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/******************************************************************************
* $Id$
*
* Project: MapServer
* Purpose: projectionObj / PROJ.4 interface.
* Author: Steve Lime and the MapServer team.
*
******************************************************************************
* Copyright (c) 1996-2005 Regents of the University of Minnesota.
*
* 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 of this Software or works derived from this 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.
****************************************************************************/
#include "mapserver.h"
#include "mapproject.h"
#include "mapthread.h"
#include <assert.h>
#include <sys/types.h>
#include <sys/stat.h>
#include "mapaxisorder.h"
#ifdef USE_PROJ
static int msTestNeedWrap( pointObj pt1, pointObj pt2, pointObj pt2_geo,
projectionObj *src_proj,
projectionObj *dst_proj );
#endif
/************************************************************************/
/* int msIsAxisInverted */
/* Check to see if we shoud invert the axis. */
/* */
/************************************************************************/
int msIsAxisInverted(int epsg_code)
{
const unsigned int row = epsg_code / 8;
const unsigned char index = epsg_code % 8;
/*check the static table*/
if ((row < sizeof(axisOrientationEpsgCodes)) && (axisOrientationEpsgCodes[row] & (1 << index)))
return MS_TRUE;
else
return MS_FALSE;
}
/************************************************************************/
/* msProjectPoint() */
/************************************************************************/
int msProjectPoint(projectionObj *in, projectionObj *out, pointObj *point)
{
#ifdef USE_PROJ
projUV p;
int error;
if( in && in->gt.need_geotransform ) {
double x_out, y_out;
x_out = in->gt.geotransform[0]
+ in->gt.geotransform[1] * point->x
+ in->gt.geotransform[2] * point->y;
y_out = in->gt.geotransform[3]
+ in->gt.geotransform[4] * point->x
+ in->gt.geotransform[5] * point->y;
point->x = x_out;
point->y = y_out;
}
/* -------------------------------------------------------------------- */
/* If the source and destination are simple and equal, then do */
/* nothing. */
/* -------------------------------------------------------------------- */
if( in && in->numargs == 1 && out && out->numargs == 1
&& strcmp(in->args[0],out->args[0]) == 0 ) {
/* do nothing, no transformation required */
}
/* -------------------------------------------------------------------- */
/* If we have a fully defined input coordinate system and */
/* output coordinate system, then we will use pj_transform. */
/* -------------------------------------------------------------------- */
else if( in && in->proj && out && out->proj ) {
double z = 0.0;
if( pj_is_latlong(in->proj) ) {
point->x *= DEG_TO_RAD;
point->y *= DEG_TO_RAD;
}
#if PJ_VERSION < 480
msAcquireLock( TLOCK_PROJ );
#endif
error = pj_transform( in->proj, out->proj, 1, 0,
&(point->x), &(point->y), &z );
#if PJ_VERSION < 480
msReleaseLock( TLOCK_PROJ );
#endif
if( error || point->x == HUGE_VAL || point->y == HUGE_VAL ) {
msSetError(MS_PROJERR,"proj says: %s","msProjectPoint()",pj_strerrno(error));
return MS_FAILURE;
}
if( pj_is_latlong(out->proj) ) {
point->x *= RAD_TO_DEG;
point->y *= RAD_TO_DEG;
}
}
/* -------------------------------------------------------------------- */
/* Otherwise we fallback to using pj_fwd() or pj_inv() and */
/* assuming that the NULL projectionObj is supposed to be */
/* lat/long in the same datum as the other projectionObj. This */
/* is essentially a backwards compatibility mode. */
/* -------------------------------------------------------------------- */
else {
/* nothing to do if the other coordinate system is also lat/long */
if( in == NULL && out != NULL && pj_is_latlong(out->proj) )
return MS_SUCCESS;
if( out == NULL && in != NULL && pj_is_latlong(in->proj) )
return MS_SUCCESS;
p.u = point->x;
p.v = point->y;
if(in==NULL || in->proj==NULL) { /* input coordinates are lat/lon */
p.u *= DEG_TO_RAD; /* convert to radians */
p.v *= DEG_TO_RAD;
p = pj_fwd(p, out->proj);
} else {
if(out==NULL || out->proj==NULL) { /* output coordinates are lat/lon */
p = pj_inv(p, in->proj);
p.u *= RAD_TO_DEG; /* convert to decimal degrees */
p.v *= RAD_TO_DEG;
} else { /* need to go from one projection to another */
p = pj_inv(p, in->proj);
p = pj_fwd(p, out->proj);
}
}
if( p.u == HUGE_VAL || p.v == HUGE_VAL )
return MS_FAILURE;
point->x = p.u;
point->y = p.v;
}
if( out && out->gt.need_geotransform ) {
double x_out, y_out;
x_out = out->gt.invgeotransform[0]
+ out->gt.invgeotransform[1] * point->x
+ out->gt.invgeotransform[2] * point->y;
y_out = out->gt.invgeotransform[3]
+ out->gt.invgeotransform[4] * point->x
+ out->gt.invgeotransform[5] * point->y;
point->x = x_out;
point->y = y_out;
}
return(MS_SUCCESS);
#else
msSetError(MS_PROJERR, "Projection support is not available.", "msProjectPoint()");
return(MS_FAILURE);
#endif
}
/************************************************************************/
/* msProjectGrowRect() */
/************************************************************************/
#ifdef USE_PROJ
static void msProjectGrowRect(projectionObj *in, projectionObj *out,
rectObj *prj_rect, int *rect_initialized,
pointObj *prj_point, int *failure )
{
if( msProjectPoint(in, out, prj_point) == MS_SUCCESS ) {
if( *rect_initialized ) {
prj_rect->miny = MS_MIN(prj_rect->miny, prj_point->y);
prj_rect->maxy = MS_MAX(prj_rect->maxy, prj_point->y);
prj_rect->minx = MS_MIN(prj_rect->minx, prj_point->x);
prj_rect->maxx = MS_MAX(prj_rect->maxx, prj_point->x);
} else {
prj_rect->minx = prj_rect->maxx = prj_point->x;
prj_rect->miny = prj_rect->maxy = prj_point->y;
*rect_initialized = MS_TRUE;
}
} else
(*failure)++;
}
#endif /* def USE_PROJ */
/************************************************************************/
/* msProjectSegment() */
/* */
/* Interpolate along a line segment for which one end */
/* reprojects and the other end does not. Finds the horizon. */
/************************************************************************/
#ifdef USE_PROJ
static int msProjectSegment( projectionObj *in, projectionObj *out,
pointObj *start, pointObj *end )
{
pointObj testPoint, subStart, subEnd;
/* -------------------------------------------------------------------- */
/* Without loss of generality we assume the first point */
/* reprojects, and the second doesn't. If that is not the case */
/* then re-call with the points reversed. */
/* -------------------------------------------------------------------- */
testPoint = *start;
if( msProjectPoint( in, out, &testPoint ) == MS_FAILURE ) {
testPoint = *end;
if( msProjectPoint( in, out, &testPoint ) == MS_FAILURE )
return MS_FAILURE;
else
return msProjectSegment( in, out, end, start );
}
/* -------------------------------------------------------------------- */
/* We will apply a binary search till we are within out */
/* tolerance. */
/* -------------------------------------------------------------------- */
subStart = *start;
subEnd = *end;
#define TOLERANCE 0.01
while( fabs(subStart.x - subEnd.x)
+ fabs(subStart.y - subEnd.y) > TOLERANCE ) {
pointObj midPoint;
midPoint.x = (subStart.x + subEnd.x) * 0.5;
midPoint.y = (subStart.y + subEnd.y) * 0.5;
testPoint = midPoint;
if( msProjectPoint( in, out, &testPoint ) == MS_FAILURE )
subEnd = midPoint;
else
subStart = midPoint;
}
/* -------------------------------------------------------------------- */
/* Now reproject the end points and return. */
/* -------------------------------------------------------------------- */
*end = subStart;
if( msProjectPoint( in, out, end ) == MS_FAILURE
|| msProjectPoint( in, out, start ) == MS_FAILURE )
return MS_FAILURE;
else
return MS_SUCCESS;
}
#endif
/************************************************************************/
/* msProjectShapeLine() */
/* */
/* Reproject a single linestring, potentially splitting into */
/* more than one line string if there are over the horizon */
/* portions. */
/* */
/* For polygons, no splitting takes place, but over the horizon */
/* points are clipped, and one segment is run from the fall */
/* over the horizon point to the come back over the horizon point. */
/************************************************************************/
#ifdef USE_PROJ
static int
msProjectShapeLine(projectionObj *in, projectionObj *out,
shapeObj *shape, int line_index)
{
int i;
pointObj lastPoint, thisPoint, wrkPoint, firstPoint;
lineObj *line = shape->line + line_index;
lineObj *line_out = line;
int valid_flag = 0; /* 1=true, -1=false, 0=unknown */
int numpoints_in = line->numpoints;
int line_alloc = numpoints_in;
int wrap_test;
#ifdef USE_PROJ_FASTPATHS
#define MAXEXTENT 20037508.34
#define M_PIby360 .0087266462599716479
#define MAXEXTENTby180 111319.4907777777777777777
if(in->wellknownprojection == wkp_lonlat && out->wellknownprojection == wkp_gmerc) {
for( i = line->numpoints-1; i >= 0; i-- ) {
#define p_x line->point[i].x
#define p_y line->point[i].y
p_x *= MAXEXTENTby180;
p_y = log(tan((90 + p_y) * M_PIby360)) * MS_RAD_TO_DEG;
p_y *= MAXEXTENTby180;
if (p_x > MAXEXTENT) p_x = MAXEXTENT;
if (p_x < -MAXEXTENT) p_x = -MAXEXTENT;
if (p_y > MAXEXTENT) p_y = MAXEXTENT;
if (p_y < -MAXEXTENT) p_y = -MAXEXTENT;
#undef p_x
#undef p_y
}
return MS_SUCCESS;
}
#endif
wrap_test = out != NULL && out->proj != NULL && pj_is_latlong(out->proj)
&& !pj_is_latlong(in->proj);
line->numpoints = 0;
if( numpoints_in > 0 )
firstPoint = line->point[0];
memset( &lastPoint, 0, sizeof(lastPoint) );
/* -------------------------------------------------------------------- */
/* Loop over all input points in linestring. */
/* -------------------------------------------------------------------- */
for( i=0; i < numpoints_in; i++ ) {
int ms_err;
wrkPoint = thisPoint = line->point[i];
ms_err = msProjectPoint(in, out, &wrkPoint );
/* -------------------------------------------------------------------- */
/* Apply wrap logic. */
/* -------------------------------------------------------------------- */
if( wrap_test && i > 0 && ms_err != MS_FAILURE ) {
double dist;
pointObj pt1Geo;
if( line_out->numpoints > 0 )
pt1Geo = line_out->point[0];
else
pt1Geo = wrkPoint; /* this is a cop out */
dist = wrkPoint.x - pt1Geo.x;
if( fabs(dist) > 180.0
&& msTestNeedWrap( thisPoint, firstPoint,
pt1Geo, in, out ) ) {
if( dist > 0.0 )
wrkPoint.x -= 360.0;
else if( dist < 0.0 )
wrkPoint.x += 360.0;
}
}
/* -------------------------------------------------------------------- */
/* Put result into output line with appropriate logic for */
/* failure breaking lines, etc. */
/* -------------------------------------------------------------------- */
if( ms_err == MS_FAILURE ) {
/* We have started out invalid */
if( i == 0 ) {
valid_flag = -1;
}
/* valid data has ended, we need to work out the horizon */
else if( valid_flag == 1 ) {
pointObj startPoint, endPoint;
startPoint = lastPoint;
endPoint = thisPoint;
if( msProjectSegment( in, out, &startPoint, &endPoint )
== MS_SUCCESS ) {
line_out->point[line_out->numpoints++] = endPoint;
}
valid_flag = -1;
}
/* Still invalid ... */
else if( valid_flag == -1 ) {
/* do nothing */
}
}
else {
/* starting out valid. */
if( i == 0 ) {
line_out->point[line_out->numpoints++] = wrkPoint;
valid_flag = 1;
}
/* Still valid, nothing special */
else if( valid_flag == 1 ) {
line_out->point[line_out->numpoints++] = wrkPoint;
}
/* we have come over the horizon, figure out where, start newline*/
else {
pointObj startPoint, endPoint;
startPoint = lastPoint;
endPoint = thisPoint;
if( msProjectSegment( in, out, &endPoint, &startPoint )
== MS_SUCCESS ) {
lineObj newLine;
/* force pre-allocation of lots of points room */
if( line_out->numpoints > 0
&& shape->type == MS_SHAPE_LINE ) {
newLine.numpoints = numpoints_in - i + 1;
newLine.point = line->point;
msAddLine( shape, &newLine );
/* new line is now lineout, but start without any points */
line_out = shape->line + shape->numlines-1;
line_out->numpoints = 0;
/* the shape->line array is realloc, refetch "line" */
line = shape->line + line_index;
} else if( line_out == line
&& line->numpoints >= i-2 ) {
newLine.numpoints = numpoints_in;
newLine.point = line->point;
msAddLine( shape, &newLine );
line = shape->line + line_index;
line_out = shape->line + shape->numlines-1;
line_out->numpoints = line->numpoints;
line->numpoints = 0;
/*
* Now realloc this array large enough to hold all
* the points we could possibly need to add.
*/
line_alloc = line_alloc * 2;
line_out->point = (pointObj *)
realloc(line_out->point,
sizeof(pointObj) * line_alloc);
}
line_out->point[line_out->numpoints++] = startPoint;
}
line_out->point[line_out->numpoints++] = wrkPoint;
valid_flag = 1;
}
}
lastPoint = thisPoint;
}
/* -------------------------------------------------------------------- */
/* Make sure that polygons are closed, even if the trip over */
/* the horizon left them unclosed. */
/* -------------------------------------------------------------------- */
if( shape->type == MS_SHAPE_POLYGON
&& line_out->numpoints > 2
&& (line_out->point[0].x != line_out->point[line_out->numpoints-1].x
|| line_out->point[0].y != line_out->point[line_out->numpoints-1].y) ) {
/* make a copy because msAddPointToLine can realloc the array */
pointObj sFirstPoint = line_out->point[0];
msAddPointToLine( line_out, &sFirstPoint );
}
return(MS_SUCCESS);
}
#endif
/************************************************************************/
/* msProjectShape() */
/************************************************************************/
int msProjectShape(projectionObj *in, projectionObj *out, shapeObj *shape)
{
#ifdef USE_PROJ
int i;
#ifdef USE_PROJ_FASTPATHS
int j;
if(in->wellknownprojection == wkp_lonlat && out->wellknownprojection == wkp_gmerc) {
for( i = shape->numlines-1; i >= 0; i-- ) {
for( j = shape->line[i].numpoints-1; j >= 0; j-- ) {
#define p_x shape->line[i].point[j].x
#define p_y shape->line[i].point[j].y
p_x *= MAXEXTENTby180;
p_y = log(tan((90 + p_y) * M_PIby360)) * MS_RAD_TO_DEG;
p_y *= MAXEXTENTby180;
if (p_x > MAXEXTENT) p_x = MAXEXTENT;
if (p_x < -MAXEXTENT) p_x = -MAXEXTENT;
if (p_y > MAXEXTENT) p_y = MAXEXTENT;
if (p_y < -MAXEXTENT) p_y = -MAXEXTENT;
#undef p_x
#undef p_y
}
}
msComputeBounds( shape ); /* fixes bug 1586 */
return MS_SUCCESS;
}
#endif
for( i = shape->numlines-1; i >= 0; i-- ) {
if( shape->type == MS_SHAPE_LINE || shape->type == MS_SHAPE_POLYGON ) {
if( msProjectShapeLine( in, out, shape, i ) == MS_FAILURE )
msShapeDeleteLine( shape, i );
} else if( msProjectLine(in, out, shape->line+i ) == MS_FAILURE ) {
msShapeDeleteLine( shape, i );
}
}
if( shape->numlines == 0 ) {
msFreeShape( shape );
return MS_FAILURE;
} else {
msComputeBounds( shape ); /* fixes bug 1586 */
return(MS_SUCCESS);
}
#else
msSetError(MS_PROJERR, "Projection support is not available.", "msProjectShape()");
return(MS_FAILURE);
#endif
}
/************************************************************************/
/* msProjectLine() */
/* */
/* This function is now normally only used for point data. */
/* msProjectShapeLine() is used for lines and polygons and has */
/* lots of logic to handle horizon crossing. */
/************************************************************************/
int msProjectLine(projectionObj *in, projectionObj *out, lineObj *line)
{
#ifdef USE_PROJ
int i, be_careful = 1;
if( be_careful )
be_careful = out->proj != NULL && pj_is_latlong(out->proj)
&& !pj_is_latlong(in->proj);
if( be_careful ) {
pointObj startPoint, thisPoint; /* locations in projected space */
startPoint = line->point[0];
for(i=0; i<line->numpoints; i++) {
double dist;
thisPoint = line->point[i];
/*
** Read comments before msTestNeedWrap() to better understand
** this dateline wrapping logic.
*/
msProjectPoint(in, out, &(line->point[i]));
if( i > 0 ) {
dist = line->point[i].x - line->point[0].x;
if( fabs(dist) > 180.0 ) {
if( msTestNeedWrap( thisPoint, startPoint,
line->point[0], in, out ) ) {
if( dist > 0.0 ) {
line->point[i].x -= 360.0;
} else if( dist < 0.0 ) {
line->point[i].x += 360.0;
}
}
}
}
}
} else {
for(i=0; i<line->numpoints; i++) {
if( msProjectPoint(in, out, &(line->point[i])) == MS_FAILURE )
return MS_FAILURE;
}
}
return(MS_SUCCESS);
#else
msSetError(MS_PROJERR, "Projection support is not available.", "msProjectLine()");
return(MS_FAILURE);
#endif
}
/************************************************************************/
/* msProjectRectGrid() */
/************************************************************************/
#define NUMBER_OF_SAMPLE_POINTS 100
int msProjectRectGrid(projectionObj *in, projectionObj *out, rectObj *rect)
{
#ifdef USE_PROJ
pointObj prj_point;
rectObj prj_rect;
int rect_initialized = MS_FALSE, failure=0;
int ix, iy;
double dx, dy;
double x, y;
dx = (rect->maxx - rect->minx)/NUMBER_OF_SAMPLE_POINTS;
dy = (rect->maxy - rect->miny)/NUMBER_OF_SAMPLE_POINTS;
/* first ensure the top left corner is processed, even if the rect
turns out to be degenerate. */
prj_point.x = rect->minx;
prj_point.y = rect->miny;
#ifdef USE_POINT_Z_M
prj_point.z = 0.0;
prj_point.m = 0.0;
#endif /* USE_POINT_Z_M */
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
failure = 0;
for(ix = 0; ix <= NUMBER_OF_SAMPLE_POINTS; ix++ ) {
x = rect->minx + ix * dx;
for(iy = 0; iy <= NUMBER_OF_SAMPLE_POINTS; iy++ ) {
y = rect->miny + iy * dy;
prj_point.x = x;
prj_point.y = y;
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
}
}
if( !rect_initialized ) {
prj_rect.minx = 0;
prj_rect.maxx = 0;
prj_rect.miny = 0;
prj_rect.maxy = 0;
msSetError(MS_PROJERR, "All points failed to reproject.", "msProjectRect()");
} else {
msDebug( "msProjectRect(): some points failed to reproject, doing internal sampling.\n" );
}
rect->minx = prj_rect.minx;
rect->miny = prj_rect.miny;
rect->maxx = prj_rect.maxx;
rect->maxy = prj_rect.maxy;
if( !rect_initialized )
return MS_FAILURE;
else
return(MS_SUCCESS);
#else
msSetError(MS_PROJERR, "Projection support is not available.", "msProjectRect()");
return(MS_FAILURE);
#endif
}
/************************************************************************/
/* msProjectRectTraditionalEdge() */
/************************************************************************/
#ifdef notdef
static int
msProjectRectTraditionalEdge(projectionObj *in, projectionObj *out,
rectObj *rect)
{
#ifdef USE_PROJ
pointObj prj_point;
rectObj prj_rect;
int rect_initialized = MS_FALSE, failure=0;
int ix, iy;
double dx, dy;
double x, y;
dx = (rect->maxx - rect->minx)/NUMBER_OF_SAMPLE_POINTS;
dy = (rect->maxy - rect->miny)/NUMBER_OF_SAMPLE_POINTS;
/* first ensure the top left corner is processed, even if the rect
turns out to be degenerate. */
prj_point.x = rect->minx;
prj_point.y = rect->miny;
#ifdef USE_POINT_Z_M
prj_point.z = 0.0;
prj_point.m = 0.0;
#endif /* USE_POINT_Z_M */
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
/* sample along top and bottom */
if(dx > 0) {
for(ix = 0; ix <= NUMBER_OF_SAMPLE_POINTS; ix++ ) {
x = rect->minx + ix * dx;
prj_point.x = x;
prj_point.y = rect->miny;
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
prj_point.x = x;
prj_point.y = rect->maxy;
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
}
}
/* sample along left and right */
if(dy > 0) {
for(iy = 0; iy <= NUMBER_OF_SAMPLE_POINTS; iy++ ) {
y = rect->miny + iy * dy;
prj_point.y = y;
prj_point.x = rect->minx;
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
prj_point.x = rect->maxx;
prj_point.y = y;
msProjectGrowRect(in,out,&prj_rect,&rect_initialized,&prj_point,
&failure);
}
}
/*
** If there have been any failures around the edges, then we had better
** try and fill in the interior to get a close bounds.
*/
if( failure > 0 )
return msProjectRectGrid( in, out, rect );
rect->minx = prj_rect.minx;
rect->miny = prj_rect.miny;
rect->maxx = prj_rect.maxx;
rect->maxy = prj_rect.maxy;
if( !rect_initialized )
return MS_FAILURE;
else
return(MS_SUCCESS);
#else
msSetError(MS_PROJERR, "Projection support is not available.", "msProjectRect()");
return(MS_FAILURE);
#endif
}
#endif /* def notdef */
/************************************************************************/
/* msProjectRectAsPolygon() */
/************************************************************************/
static int
msProjectRectAsPolygon(projectionObj *in, projectionObj *out,
rectObj *rect)
{
#ifdef USE_PROJ
shapeObj polygonObj;
lineObj ring;
/* pointObj ringPoints[NUMBER_OF_SAMPLE_POINTS*4+4]; */
pointObj *ringPoints;
int ix, iy;
double dx, dy;
ringPoints = (pointObj*) calloc(sizeof(pointObj),NUMBER_OF_SAMPLE_POINTS*4+4);
ring.point = ringPoints;
ring.numpoints = 0;
msInitShape( &polygonObj );
polygonObj.type = MS_SHAPE_POLYGON;
/* -------------------------------------------------------------------- */
/* Build polygon as steps around the source rectangle. */
/* -------------------------------------------------------------------- */
dx = (rect->maxx - rect->minx)/NUMBER_OF_SAMPLE_POINTS;
dy = (rect->maxy - rect->miny)/NUMBER_OF_SAMPLE_POINTS;
if(dx==0 && dy==0) {
pointObj foo;
msDebug( "msProjectRect(): Warning: degenerate rect {%f,%f,%f,%f}\n",rect->minx,rect->miny,rect->minx,rect->miny );
foo.x = rect->minx;
foo.y = rect->miny;
msProjectPoint(in,out,&foo);
rect->minx=rect->maxx=foo.x;
rect->miny=rect->maxy=foo.y;
return MS_SUCCESS;
}
/* sample along top */
if(dx != 0) {
for(ix = 0; ix <= NUMBER_OF_SAMPLE_POINTS; ix++ ) {
ringPoints[ring.numpoints].x = rect->minx + ix * dx;
ringPoints[ring.numpoints++].y = rect->miny;
}
}
/* sample on along right side */
if(dy != 0) {
for(iy = 1; iy <= NUMBER_OF_SAMPLE_POINTS; iy++ ) {
ringPoints[ring.numpoints].x = rect->maxx;
ringPoints[ring.numpoints++].y = rect->miny + iy * dy;
}
}
/* sample along bottom */
if(dx != 0) {
for(ix = NUMBER_OF_SAMPLE_POINTS-1; ix >= 0; ix-- ) {
ringPoints[ring.numpoints].x = rect->minx + ix * dx;
ringPoints[ring.numpoints++].y = rect->maxy;
}
}
/* sample on along left side */
if(dy != 0) {
for(iy = NUMBER_OF_SAMPLE_POINTS-1; iy >= 0; iy-- ) {
ringPoints[ring.numpoints].x = rect->minx;
ringPoints[ring.numpoints++].y = rect->miny + iy * dy;
}
}
msAddLineDirectly( &polygonObj, &ring );
/* -------------------------------------------------------------------- */
/* Attempt to reproject. */
/* -------------------------------------------------------------------- */
msProjectShapeLine( in, out, &polygonObj, 0 );
/* If no points reprojected, try a grid sampling */
if( polygonObj.numlines == 0 || polygonObj.line[0].numpoints == 0 ) {
msFreeShape( &polygonObj );
return msProjectRectGrid( in, out, rect );
}
/* -------------------------------------------------------------------- */
/* Collect bounds. */
/* -------------------------------------------------------------------- */
rect->minx = rect->maxx = polygonObj.line[0].point[0].x;
rect->miny = rect->maxy = polygonObj.line[0].point[0].y;
for( ix = 1; ix < polygonObj.line[0].numpoints; ix++ ) {
pointObj *pnt = polygonObj.line[0].point + ix;
rect->minx = MS_MIN(rect->minx,pnt->x);
rect->maxx = MS_MAX(rect->maxx,pnt->x);
rect->miny = MS_MIN(rect->miny,pnt->y);
rect->maxy = MS_MAX(rect->maxy,pnt->y);
}
msFreeShape( &polygonObj );
/* -------------------------------------------------------------------- */
/* Special case to handle reprojection from "more than the */
/* whole world" projected coordinates that sometimes produce a */
/* region greater than 360 degrees wide due to various wrapping */
/* logic. */
/* -------------------------------------------------------------------- */
if( out && pj_is_latlong(out->proj) && in && !pj_is_latlong(in->proj)
&& rect->maxx - rect->minx > 360.0 ) {
rect->maxx = 180;
rect->minx = -180;
}
return MS_SUCCESS;
#else
msSetError(MS_PROJERR, "Projection support is not available.", "msProjectRect()");
return(MS_FAILURE);
#endif
}
/************************************************************************/
/* msProjectRect() */
/************************************************************************/
int msProjectRect(projectionObj *in, projectionObj *out, rectObj *rect)
{
#ifdef notdef
return msProjectRectTraditionalEdge( in, out, rect );
#else
return msProjectRectAsPolygon( in, out, rect );
#endif
}
/************************************************************************/
/* msProjectionsDiffer() */
/************************************************************************/
/*
** Compare two projections, and return MS_TRUE if they differ.
**
** For now this is implemented by exact comparison of the projection
** arguments, but eventually this should call a PROJ.4 function with
** more awareness of the issues.
**
** NOTE: MS_FALSE is returned if either of the projection objects
** has no arguments, since reprojection won't work anyways.
*/
int msProjectionsDiffer( projectionObj *proj1, projectionObj *proj2 )
{
int i;
if( proj1->numargs == 0 || proj2->numargs == 0 )
return MS_FALSE;
if( proj1->numargs != proj2->numargs )
return MS_TRUE;
/* This test should be more rigerous. */
if( proj1->gt.need_geotransform
|| proj2->gt.need_geotransform )
return MS_TRUE;
for( i = 0; i < proj1->numargs; i++ ) {
if( strcmp(proj1->args[i],proj2->args[i]) != 0 )
return MS_TRUE;
}
return MS_FALSE;
}
/************************************************************************/
/* msTestNeedWrap() */
/************************************************************************/
/*
Frank Warmerdam, Nov, 2001.
See Also:
http://mapserver.gis.umn.edu/bugs/show_bug.cgi?id=15
Proposal:
Modify msProjectLine() so that it "dateline wraps" objects when necessary
in order to preserve their shape when reprojecting to lat/long. This
will be accomplished by:
1) As each vertex is reprojected, compare the X distance between that
vertex and the previous vertex. If it is less than 180 then proceed to
the next vertex without any special logic, otherwise:
2) Reproject the center point of the line segment from the last vertex to
the current vertex into lat/long. Does it's longitude lie between the
longitudes of the start and end point. If yes, return to step 1) for
the next vertex ... everything is fine.
3) We have determined that this line segment is suffering from 360 degree
wrap to keep in the -180 to +180 range. Now add or subtract 360 degrees
as determined from the original sign of the distances.
This is similar to the code there now (though disabled in CVS); however,
it will ensure that big boxes will remain big, and not get dateline wrapped
because of the extra test in step 2). However step 2 is invoked only very
rarely so this process takes little more than the normal process. In fact,
if we were sufficiently concerned about performance we could do a test on the
shape MBR in lat/long space, and if the width is less than 180 we know we never
need to even do test 1).
What doesn't this resolve:
This ensures that individual lines are kept in the proper shape when
reprojected to geographic space. However, it does not:
o Ensure that all rings of a polygon will get transformed to the same "side"
of the world. Depending on starting points of the different rings it is
entirely possible for one ring to end up in the -180 area and another ring
from the same polygon to end up in the +180 area. We might possibly be
able to achieve this though, by treating the multi-ring polygon as a whole
and testing the first point of each additional ring against the last
vertex of the previous ring (or any previous vertex for that matter).
o It does not address the need to cut up lines and polygons into distinct
chunks to preserve the correct semantics. Really a polygon that
spaces the dateline in a -180 to 180 view should get split into two
polygons. We haven't addressed that, though if it were to be addressed,
it could be done as a followon and distinct step from what we are doing
above. In fact this sort of improvement (split polygons based on dateline
or view window) should be done for all lat/long shapes regardless of
whether they are being reprojected from another projection.
o It does not address issues related to viewing rectangles that go outside
the -180 to 180 longitude range. For instance, it is entirely reasonable
to want a 160 to 200 longitude view to see an area on the dateline clearly.
Currently shapes in the -180 to -160 range which should be displayed in the