-
-
Notifications
You must be signed in to change notification settings - Fork 3k
/
feature.cpp
1397 lines (1172 loc) · 41.1 KB
/
feature.cpp
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
/*
* libpal - Automated Placement of Labels Library
*
* Copyright (C) 2008 Maxence Laurent, MIS-TIC, HEIG-VD
* University of Applied Sciences, Western Switzerland
* http://www.hes-so.ch
*
* Contact:
* maxence.laurent <at> heig-vd <dot> ch
* or
* eric.taillard <at> heig-vd <dot> ch
*
* This file is part of libpal.
*
* libpal is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* libpal is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with libpal. If not, see <http://www.gnu.org/licenses/>.
*
*/
#define _CRT_SECURE_NO_DEPRECATE
#if defined(_VERBOSE_) || (_DEBUG_)
#include <iostream>
#endif
#include "qgsgeometry.h"
#include "pal.h"
#include "layer.h"
#include "feature.h"
#include "geomfunction.h"
#include "labelposition.h"
#include "pointset.h"
#include "util.h"
#include "qgis.h"
#include <QLinkedList>
#include <cmath>
#include <cfloat>
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
namespace pal
{
Feature::Feature( Layer* l, const QString &geom_id, PalGeometry* userG, double lx, double ly )
: layer( l )
, userGeom( userG )
, label_x( lx )
, label_y( ly )
, distlabel( 0 )
, labelInfo( NULL )
, uid( geom_id )
, fixedPos( false )
, fixedPosX( 0.0 )
, fixedPosY( 0.0 )
, quadOffset( false )
, quadOffsetX( 0.0 )
, quadOffsetY( 0.0 )
, offsetPos( false )
, offsetPosX( 0.0 )
, offsetPosY( 0.0 )
, fixedRotation( false )
, fixedAngle( 0.0 )
, repeatDist( 0.0 )
, alwaysShow( false )
, mFixedQuadrant( false )
, mPriority( -1.0 )
{
assert( finite( lx ) && finite( ly ) );
}
Feature::~Feature()
{
}
double Feature::calculatePriority() const
{
return mPriority >= 0 ? mPriority : layer->priority();
}
////////////
FeaturePart::FeaturePart( Feature *feat, const GEOSGeometry* geom )
: mFeature( feat )
{
// we'll remove const, but we won't modify that geometry
mGeos = const_cast<GEOSGeometry*>( geom );
mOwnsGeom = false; // geometry is owned by Feature class
extractCoords( geom );
holeOf = NULL;
for ( int i = 0; i < mHoles.count(); i++ )
{
mHoles.at( i )->holeOf = this;
}
}
FeaturePart::~FeaturePart()
{
// X and Y are deleted in PointSet
qDeleteAll( mHoles );
mHoles.clear();
}
void FeaturePart::extractCoords( const GEOSGeometry* geom )
{
const GEOSCoordSequence *coordSeq;
GEOSContextHandle_t geosctxt = geosContext();
type = GEOSGeomTypeId_r( geosctxt, geom );
if ( type == GEOS_POLYGON )
{
if ( GEOSGetNumInteriorRings_r( geosctxt, geom ) > 0 )
{
int numHoles = GEOSGetNumInteriorRings_r( geosctxt, geom );
for ( int i = 0; i < numHoles; ++i )
{
const GEOSGeometry* interior = GEOSGetInteriorRingN_r( geosctxt, geom, i );
FeaturePart* hole = new FeaturePart( mFeature, interior );
hole->holeOf = NULL;
// possibly not needed. it's not done for the exterior ring, so I'm not sure
// why it's just done here...
reorderPolygon( hole->nbPoints, hole->x, hole->y );
mHoles << hole;
}
}
// use exterior ring for the extraction of coordinates that follows
geom = GEOSGetExteriorRing_r( geosctxt, geom );
}
else
{
qDeleteAll( mHoles );
mHoles.clear();
}
// find out number of points
nbPoints = GEOSGetNumCoordinates_r( geosctxt, geom );
coordSeq = GEOSGeom_getCoordSeq_r( geosctxt, geom );
// initialize bounding box
xmin = ymin = DBL_MAX;
xmax = ymax = -DBL_MAX;
// initialize coordinate arrays
x = new double[nbPoints];
y = new double[nbPoints];
for ( int i = 0; i < nbPoints; ++i )
{
GEOSCoordSeq_getX_r( geosctxt, coordSeq, i, &x[i] );
GEOSCoordSeq_getY_r( geosctxt, coordSeq, i, &y[i] );
xmax = x[i] > xmax ? x[i] : xmax;
xmin = x[i] < xmin ? x[i] : xmin;
ymax = y[i] > ymax ? y[i] : ymax;
ymin = y[i] < ymin ? y[i] : ymin;
}
}
Layer* FeaturePart::layer()
{
return mFeature->layer;
}
QString FeaturePart::getUID() const
{
return mFeature->uid;
}
LabelPosition::Quadrant FeaturePart::quadrantFromOffset() const
{
if ( mFeature->quadOffsetX < 0 )
{
if ( mFeature->quadOffsetY < 0 )
{
return LabelPosition::QuadrantAboveLeft;
}
else if ( mFeature->quadOffsetY > 0 )
{
return LabelPosition::QuadrantBelowLeft;
}
else
{
return LabelPosition::QuadrantLeft;
}
}
else if ( mFeature->quadOffsetX > 0 )
{
if ( mFeature->quadOffsetY < 0 )
{
return LabelPosition::QuadrantAboveRight;
}
else if ( mFeature->quadOffsetY > 0 )
{
return LabelPosition::QuadrantBelowRight;
}
else
{
return LabelPosition::QuadrantRight;
}
}
else
{
if ( mFeature->quadOffsetY < 0 )
{
return LabelPosition::QuadrantAbove;
}
else if ( mFeature->quadOffsetY > 0 )
{
return LabelPosition::QuadrantBelow;
}
else
{
return LabelPosition::QuadrantOver;
}
}
}
int FeaturePart::setPositionOverPoint( double x, double y, LabelPosition ***lPos, double angle, PointSet *mapShape )
{
int nbp = 1;
*lPos = new LabelPosition *[nbp];
// get from feature
double labelW = mFeature->label_x;
double labelH = mFeature->label_y;
double cost = 0.0001;
int id = 0;
double xdiff = -labelW / 2.0;
double ydiff = -labelH / 2.0;
if ( mFeature->quadOffset )
{
if ( mFeature->quadOffsetX != 0 )
{
xdiff += labelW / 2.0 * mFeature->quadOffsetX;
}
if ( mFeature->quadOffsetY != 0 )
{
ydiff += labelH / 2.0 * mFeature->quadOffsetY;
}
}
if ( ! mFeature->fixedPosition() )
{
if ( angle != 0 )
{
double xd = xdiff * cos( angle ) - ydiff * sin( angle );
double yd = xdiff * sin( angle ) + ydiff * cos( angle );
xdiff = xd;
ydiff = yd;
}
}
if ( mFeature->layer->arrangement() == P_POINT )
{
//if in "around point" placement mode, then we use the label distance to determine
//the label's offset
if ( qgsDoubleNear( mFeature->quadOffsetX , 0.0 ) )
{
ydiff += mFeature->quadOffsetY * mFeature->distlabel;
}
else if ( qgsDoubleNear( mFeature->quadOffsetY, 0.0 ) )
{
xdiff += mFeature->quadOffsetX * mFeature->distlabel;
}
else
{
xdiff += mFeature->quadOffsetX * M_SQRT1_2 * mFeature->distlabel;
ydiff += mFeature->quadOffsetY * M_SQRT1_2 * mFeature->distlabel;
}
}
else if ( mFeature->offsetPos )
{
if ( mFeature->offsetPosX != 0 )
{
xdiff += mFeature->offsetPosX;
}
if ( mFeature->offsetPosY != 0 )
{
ydiff += mFeature->offsetPosY;
}
}
double lx = x + xdiff;
double ly = y + ydiff;
if ( mapShape && type == GEOS_POLYGON && mFeature->layer->fitInPolygonOnly() )
{
if ( !mapShape->containsLabelCandidate( lx, ly, labelW, labelH, angle ) )
{
delete[] *lPos;
*lPos = 0;
return 0;
}
}
( *lPos )[0] = new LabelPosition( id, lx, ly, labelW, labelH, angle, cost, this, false, quadrantFromOffset() );
return nbp;
}
int FeaturePart::setPositionForPoint( double x, double y, LabelPosition ***lPos, double angle, PointSet *mapShape )
{
#ifdef _DEBUG_
std::cout << "SetPosition (point) : " << layer->name << "/" << uid << std::endl;
#endif
double labelWidth = mFeature->label_x;
double labelHeight = mFeature->label_y;
double distanceToLabel = mFeature->distlabel;
int numberCandidates = mFeature->layer->pal->point_p;
//std::cout << "Nbp : " << nbp << std::endl;
int icost = 0;
int inc = 2;
double candidateAngleIncrement = 2 * M_PI / numberCandidates; /* angle bw 2 pos */
/* various angles */
double a90 = M_PI / 2;
double a180 = M_PI;
double a270 = a180 + a90;
double a360 = 2 * M_PI;
double gamma1, gamma2;
if ( distanceToLabel > 0 )
{
gamma1 = atan2( labelHeight / 2, distanceToLabel + labelWidth / 2 );
gamma2 = atan2( labelWidth / 2, distanceToLabel + labelHeight / 2 );
}
else
{
gamma1 = gamma2 = a90 / 3.0;
}
if ( gamma1 > a90 / 3.0 )
gamma1 = a90 / 3.0;
if ( gamma2 > a90 / 3.0 )
gamma2 = a90 / 3.0;
if ( gamma1 == 0 || gamma2 == 0 )
{
std::cout << "Oups... label size error..." << std::endl;
}
QList< LabelPosition* > candidates;
int i;
double angleToCandidate;
for ( i = 0, angleToCandidate = M_PI / 4; i < numberCandidates; i++, angleToCandidate += candidateAngleIncrement )
{
double labelX = x;
double labelY = y;
if ( angleToCandidate > a360 )
angleToCandidate -= a360;
LabelPosition::Quadrant quadrant = LabelPosition::QuadrantOver;
if ( angleToCandidate < gamma1 || angleToCandidate > a360 - gamma1 ) // on the right
{
labelX += distanceToLabel;
double iota = ( angleToCandidate + gamma1 );
if ( iota > a360 - gamma1 )
iota -= a360;
//ly += -yrm/2.0 + tan(alpha)*(distlabel + xrm/2);
labelY += -labelHeight + labelHeight * iota / ( 2 * gamma1 );
quadrant = LabelPosition::QuadrantRight;
}
else if ( angleToCandidate < a90 - gamma2 ) // top-right
{
labelX += distanceToLabel * cos( angleToCandidate );
labelY += distanceToLabel * sin( angleToCandidate );
quadrant = LabelPosition::QuadrantAboveRight;
}
else if ( angleToCandidate < a90 + gamma2 ) // top
{
//lx += -xrm/2.0 - tan(alpha+a90)*(distlabel + yrm/2);
labelX += -labelWidth * ( angleToCandidate - a90 + gamma2 ) / ( 2 * gamma2 );
labelY += distanceToLabel;
quadrant = LabelPosition::QuadrantAbove;
}
else if ( angleToCandidate < a180 - gamma1 ) // top left
{
labelX += distanceToLabel * cos( angleToCandidate ) - labelWidth;
labelY += distanceToLabel * sin( angleToCandidate );
quadrant = LabelPosition::QuadrantAboveLeft;
}
else if ( angleToCandidate < a180 + gamma1 ) // left
{
labelX += -distanceToLabel - labelWidth;
//ly += -yrm/2.0 - tan(alpha)*(distlabel + xrm/2);
labelY += - ( angleToCandidate - a180 + gamma1 ) * labelHeight / ( 2 * gamma1 );
quadrant = LabelPosition::QuadrantLeft;
}
else if ( angleToCandidate < a270 - gamma2 ) // down - left
{
labelX += distanceToLabel * cos( angleToCandidate ) - labelWidth;
labelY += distanceToLabel * sin( angleToCandidate ) - labelHeight;
quadrant = LabelPosition::QuadrantBelowLeft;
}
else if ( angleToCandidate < a270 + gamma2 ) // down
{
labelY += -distanceToLabel - labelHeight;
//lx += -xrm/2.0 + tan(alpha+a90)*(distlabel + yrm/2);
labelX += -labelWidth + ( angleToCandidate - a270 + gamma2 ) * labelWidth / ( 2 * gamma2 );
quadrant = LabelPosition::QuadrantBelow;
}
else if ( angleToCandidate < a360 ) // down - right
{
labelX += distanceToLabel * cos( angleToCandidate );
labelY += distanceToLabel * sin( angleToCandidate ) - labelHeight;
quadrant = LabelPosition::QuadrantBelowRight;
}
double cost;
if ( numberCandidates == 1 )
cost = 0.0001;
else
cost = 0.0001 + 0.0020 * double( icost ) / double( numberCandidates - 1 );
if ( mapShape && type == GEOS_POLYGON && mFeature->layer->fitInPolygonOnly() )
{
if ( !mapShape->containsLabelCandidate( labelX, labelY, labelWidth, labelHeight, angle ) )
{
continue;
}
}
candidates << new LabelPosition( i, labelX, labelY, labelWidth, labelHeight, angle, cost, this, false, quadrant );
icost += inc;
if ( icost == numberCandidates )
{
icost = numberCandidates - 1;
inc = -2;
}
else if ( icost > numberCandidates )
{
icost = numberCandidates - 2;
inc = -2;
}
}
if ( !candidates.isEmpty() )
{
*lPos = new LabelPosition *[candidates.count()];
for ( int i = 0; i < candidates.count(); ++i )
{
( *lPos )[i] = candidates.at( i );
}
}
return candidates.count();
}
// TODO work with squared distance by removing call to sqrt or dist_euc2d
int FeaturePart::setPositionForLine( LabelPosition ***lPos, PointSet *mapShape )
{
#ifdef _DEBUG_
std::cout << "SetPosition (line) : " << layer->name << "/" << uid << std::endl;
#endif
int i;
double distlabel = mFeature->distlabel;
double xrm = mFeature->label_x;
double yrm = mFeature->label_y;
double dist;
double bx, by, ex, ey;
int nbls;
double alpha;
double cost;
LineArrangementFlags flags = mFeature->layer->arrangementFlags();
if ( flags == 0 )
flags = FLAG_ON_LINE; // default flag
QLinkedList<LabelPosition*> positions;
int nbPoints;
double *x;
double *y;
PointSet * line = mapShape;
#ifdef _DEBUG_FULL_
std::cout << "New line of " << line->nbPoints << " points with label " << xrm << "x" << yrm << std::endl;
#endif
nbPoints = line->nbPoints;
x = line->x;
y = line->y;
double ll = line->length(); // line length
nbls = ( int )( ll / xrm ); // ratio bw line length and label width
#ifdef _DEBUG_FULL_
std::cout << "line length :" << ll << std::endl;
std::cout << "nblp :" << nbls << std::endl;
#endif
dist = ( ll - xrm );
double l;
if ( nbls > 0 )
{
//dist /= nbls;
l = 0;
dist = qMin( yrm, xrm );
}
else // line length < label with => centering label position
{
l = - ( xrm - ll ) / 2.0;
dist = xrm;
ll = xrm;
}
double birdfly;
double beta;
i = 0;
//for (i=0;i<nbp;i++){
#ifdef _DEBUG_FULL_
std::cout << l << " / " << ll - xrm << std::endl;
#endif
while ( l < ll - xrm )
{
// => bx, by
line->getPointByDistance( l, &bx, &by );
// same but l = l+xrm
line->getPointByDistance( l + xrm, &ex, &ey );
// Label is bigger than line ...
if ( l < 0 )
birdfly = sqrt(( x[nbPoints-1] - x[0] ) * ( x[nbPoints-1] - x[0] )
+ ( y[nbPoints-1] - y[0] ) * ( y[nbPoints-1] - y[0] ) );
else
birdfly = sqrt(( ex - bx ) * ( ex - bx ) + ( ey - by ) * ( ey - by ) );
cost = birdfly / xrm;
if ( cost > 0.98 )
cost = 0.0001;
else
cost = ( 1 - cost ) / 100; // < 0.0001, 0.01 > (but 0.005 is already pretty much)
// penalize positions which are further from the line's midpoint
double costCenter = qAbs( ll / 2 - ( l + xrm / 2 ) ) / ll; // <0, 0.5>
cost += costCenter / 1000; // < 0, 0.0005 >
if ( qgsDoubleNear( ey, by ) && qgsDoubleNear( ex, bx ) )
{
std::cout << "b: " << bx << ";" << by << std::endl;
std::cout << "e: " << ex << ";" << ey << std::endl;
alpha = 0.0;
}
else
alpha = atan2( ey - by, ex - bx );
beta = alpha + M_PI / 2;
#ifdef _DEBUG_FULL_
std::cout << " Create new label" << std::endl;
#endif
if ( mFeature->layer->arrangement() == P_LINE )
{
// find out whether the line direction for this candidate is from right to left
bool isRightToLeft = ( alpha > M_PI / 2 || alpha <= -M_PI / 2 );
// meaning of above/below may be reversed if using line position dependent orientation
// and the line has right-to-left direction
bool reversed = (( flags & FLAG_MAP_ORIENTATION ) ? isRightToLeft : false );
bool aboveLine = ( !reversed && ( flags & FLAG_ABOVE_LINE ) ) || ( reversed && ( flags & FLAG_BELOW_LINE ) );
bool belowLine = ( !reversed && ( flags & FLAG_BELOW_LINE ) ) || ( reversed && ( flags & FLAG_ABOVE_LINE ) );
if ( aboveLine )
positions.append( new LabelPosition( i, bx + cos( beta ) *distlabel, by + sin( beta ) *distlabel, xrm, yrm, alpha, cost, this, isRightToLeft ) ); // Line
if ( belowLine )
positions.append( new LabelPosition( i, bx - cos( beta ) *( distlabel + yrm ), by - sin( beta ) *( distlabel + yrm ), xrm, yrm, alpha, cost, this, isRightToLeft ) ); // Line
if ( flags & FLAG_ON_LINE )
positions.append( new LabelPosition( i, bx - yrm*cos( beta ) / 2, by - yrm*sin( beta ) / 2, xrm, yrm, alpha, cost, this, isRightToLeft ) ); // Line
}
else if ( mFeature->layer->arrangement() == P_HORIZ )
{
positions.append( new LabelPosition( i, bx - xrm / 2, by - yrm / 2, xrm, yrm, 0, cost, this ) ); // Line
}
else
{
// an invalid arrangement?
}
l += dist;
i++;
if ( nbls == 0 )
break;
}
int nbp = positions.size();
*lPos = new LabelPosition *[nbp];
i = 0;
while ( positions.size() > 0 )
{
( *lPos )[i] = positions.takeFirst();
i++;
}
return nbp;
}
LabelPosition* FeaturePart::curvedPlacementAtOffset( PointSet* path_positions, double* path_distances, int orientation, int index, double distance )
{
// Check that the given distance is on the given index and find the correct index and distance if not
while ( distance < 0 && index > 1 )
{
index--;
distance += path_distances[index];
}
if ( index <= 1 && distance < 0 ) // We've gone off the start, fail out
{
return NULL;
}
// Same thing, checking if we go off the end
while ( index < path_positions->nbPoints && distance > path_distances[index] )
{
distance -= path_distances[index];
index += 1;
}
if ( index >= path_positions->nbPoints )
{
return NULL;
}
// Keep track of the initial index,distance incase we need to re-call get_placement_offset
int initial_index = index;
double initial_distance = distance;
double string_height = mFeature->labelInfo->label_height;
double old_x = path_positions->x[index-1];
double old_y = path_positions->y[index-1];
double new_x = path_positions->x[index];
double new_y = path_positions->y[index];
double dx = new_x - old_x;
double dy = new_y - old_y;
double segment_length = path_distances[index];
if ( segment_length == 0 )
{
// Not allowed to place across on 0 length segments or discontinuities
return NULL;
}
LabelPosition* slp = NULL;
LabelPosition* slp_tmp = NULL;
// current_placement = placement_result()
double angle = atan2( -dy, dx );
bool orientation_forced = ( orientation != 0 ); // Whether the orientation was set by the caller
if ( !orientation_forced )
orientation = ( angle > 0.55 * M_PI || angle < -0.45 * M_PI ? -1 : 1 );
int upside_down_char_count = 0; // Count of characters that are placed upside down.
for ( int i = 0; i < mFeature->labelInfo->char_num; i++ )
{
double last_character_angle = angle;
// grab the next character according to the orientation
LabelInfo::CharacterInfo& ci = ( orientation > 0 ? mFeature->labelInfo->char_info[i] : mFeature->labelInfo->char_info[mFeature->labelInfo->char_num-i-1] );
// Coordinates this character will start at
if ( segment_length == 0 )
{
// Not allowed to place across on 0 length segments or discontinuities
delete slp;
return NULL;
}
double start_x = old_x + dx * distance / segment_length;
double start_y = old_y + dy * distance / segment_length;
// Coordinates this character ends at, calculated below
double end_x = 0;
double end_y = 0;
//std::cerr << "segment len " << segment_length << " distance " << distance << std::endl;
if ( segment_length - distance >= ci.width )
{
// if the distance remaining in this segment is enough, we just go further along the segment
distance += ci.width;
end_x = old_x + dx * distance / segment_length;
end_y = old_y + dy * distance / segment_length;
}
else
{
// If there isn't enough distance left on this segment
// then we need to search until we find the line segment that ends further than ci.width away
do
{
old_x = new_x;
old_y = new_y;
index++;
if ( index >= path_positions->nbPoints ) // Bail out if we run off the end of the shape
{
delete slp;
return NULL;
}
new_x = path_positions->x[index];
new_y = path_positions->y[index];
dx = new_x - old_x;
dy = new_y - old_y;
segment_length = path_distances[index];
//std::cerr << "-> " << sqrt(pow(start_x - new_x,2) + pow(start_y - new_y,2)) << " vs " << ci.width << std::endl;
}
while ( sqrt( pow( start_x - new_x, 2 ) + pow( start_y - new_y, 2 ) ) < ci.width ); // Distance from start_ to new_
// Calculate the position to place the end of the character on
findLineCircleIntersection( start_x, start_y, ci.width, old_x, old_y, new_x, new_y, end_x, end_y );
// Need to calculate distance on the new segment
distance = sqrt( pow( old_x - end_x, 2 ) + pow( old_y - end_y, 2 ) );
}
// Calculate angle from the start of the character to the end based on start_/end_ position
angle = atan2( start_y - end_y, end_x - start_x );
//angle = atan2(end_y-start_y, end_x-start_x);
// Test last_character_angle vs angle
// since our rendering angle has changed then check against our
// max allowable angle change.
double angle_delta = last_character_angle - angle;
// normalise between -180 and 180
while ( angle_delta > M_PI ) angle_delta -= 2 * M_PI;
while ( angle_delta < -M_PI ) angle_delta += 2 * M_PI;
if (( mFeature->labelInfo->max_char_angle_inside > 0 && angle_delta > 0
&& angle_delta > mFeature->labelInfo->max_char_angle_inside*( M_PI / 180 ) )
|| ( mFeature->labelInfo->max_char_angle_outside < 0 && angle_delta < 0
&& angle_delta < mFeature->labelInfo->max_char_angle_outside*( M_PI / 180 ) ) )
{
delete slp;
return NULL;
}
double render_angle = angle;
double render_x = start_x;
double render_y = start_y;
// Center the text on the line
//render_x -= ((string_height/2.0) - 1.0)*math.cos(render_angle+math.pi/2)
//render_y += ((string_height/2.0) - 1.0)*math.sin(render_angle+math.pi/2)
if ( orientation < 0 )
{
// rotate in place
render_x += ci.width * cos( render_angle ); //- (string_height-2)*sin(render_angle);
render_y -= ci.width * sin( render_angle ); //+ (string_height-2)*cos(render_angle);
render_angle += M_PI;
}
//std::cerr << "adding part: " << render_x << " " << render_y << std::endl;
LabelPosition* tmp = new LabelPosition( 0, render_x /*- xBase*/, render_y /*- yBase*/, ci.width, string_height, -render_angle, 0.0001, this );
tmp->setPartId( orientation > 0 ? i : mFeature->labelInfo->char_num - i - 1 );
if ( slp == NULL )
slp = tmp;
else
slp_tmp->setNextPart( tmp );
slp_tmp = tmp;
//current_placement.add_node(ci.character,render_x, -render_y, render_angle);
//current_placement.add_node(ci.character,render_x - current_placement.starting_x, render_y - current_placement.starting_y, render_angle)
// Normalise to 0 <= angle < 2PI
while ( render_angle >= 2*M_PI ) render_angle -= 2 * M_PI;
while ( render_angle < 0 ) render_angle += 2 * M_PI;
if ( render_angle > M_PI / 2 && render_angle < 1.5*M_PI )
upside_down_char_count++;
}
// END FOR
// If we placed too many characters upside down
if ( upside_down_char_count >= mFeature->labelInfo->char_num / 2.0 )
{
// if we auto-detected the orientation then retry with the opposite orientation
if ( !orientation_forced )
{
orientation = -orientation;
delete slp;
slp = curvedPlacementAtOffset( path_positions, path_distances, orientation, initial_index, initial_distance );
}
else
{
// Otherwise we have failed to find a placement
delete slp;
return NULL;
}
}
return slp;
}
static LabelPosition* _createCurvedCandidate( LabelPosition* lp, double angle, double dist )
{
LabelPosition* newLp = new LabelPosition( *lp );
newLp->offsetPosition( dist*cos( angle + M_PI / 2 ), dist*sin( angle + M_PI / 2 ) );
return newLp;
}
int FeaturePart::setPositionForLineCurved( LabelPosition ***lPos, PointSet* mapShape )
{
// label info must be present
if ( mFeature->labelInfo == NULL || mFeature->labelInfo->char_num == 0 )
return 0;
// distance calculation
double* path_distances = new double[mapShape->nbPoints];
double total_distance = 0;
double old_x = -1.0, old_y = -1.0;
for ( int i = 0; i < mapShape->nbPoints; i++ )
{
if ( i == 0 )
path_distances[i] = 0;
else
path_distances[i] = sqrt( pow( old_x - mapShape->x[i], 2 ) + pow( old_y - mapShape->y[i], 2 ) );
old_x = mapShape->x[i];
old_y = mapShape->y[i];
total_distance += path_distances[i];
}
if ( total_distance == 0 )
{
delete[] path_distances;
return 0;
}
QLinkedList<LabelPosition*> positions;
double delta = qMax( mFeature->labelInfo->label_height, total_distance / 10.0 );
unsigned long flags = mFeature->layer->arrangementFlags();
if ( flags == 0 )
flags = FLAG_ON_LINE; // default flag
// generate curved labels
for ( int i = 0; i*delta < total_distance; i++ )
{
LabelPosition* slp = curvedPlacementAtOffset( mapShape, path_distances, 0, 1, i * delta );
if ( slp )
{
// evaluate cost
double angle_diff = 0.0, angle_last = 0.0, diff;
LabelPosition* tmp = slp;
double sin_avg = 0, cos_avg = 0;
while ( tmp )
{
if ( tmp != slp ) // not first?
{
diff = fabs( tmp->getAlpha() - angle_last );
if ( diff > 2*M_PI ) diff -= 2 * M_PI;
diff = qMin( diff, 2 * M_PI - diff ); // difference 350 deg is actually just 10 deg...
angle_diff += diff;
}
sin_avg += sin( tmp->getAlpha() );
cos_avg += cos( tmp->getAlpha() );
angle_last = tmp->getAlpha();
tmp = tmp->getNextPart();
}
double angle_diff_avg = mFeature->labelInfo->char_num > 1 ? ( angle_diff / ( mFeature->labelInfo->char_num - 1 ) ) : 0; // <0, pi> but pi/8 is much already
double cost = angle_diff_avg / 100; // <0, 0.031 > but usually <0, 0.003 >
if ( cost < 0.0001 ) cost = 0.0001;
// penalize positions which are further from the line's midpoint
double labelCenter = ( i * delta ) + mFeature->label_x / 2;
double costCenter = qAbs( total_distance / 2 - labelCenter ) / total_distance; // <0, 0.5>
cost += costCenter / 1000; // < 0, 0.0005 >
//std::cerr << "cost " << angle_diff << " vs " << costCenter << std::endl;
slp->setCost( cost );
// average angle is calculated with respect to periodicity of angles
double angle_avg = atan2( sin_avg / mFeature->labelInfo->char_num, cos_avg / mFeature->labelInfo->char_num );
// displacement
if ( flags & FLAG_ABOVE_LINE )
positions.append( _createCurvedCandidate( slp, angle_avg, mFeature->distlabel ) );
if ( flags & FLAG_ON_LINE )
positions.append( _createCurvedCandidate( slp, angle_avg, -mFeature->labelInfo->label_height / 2 ) );
if ( flags & FLAG_BELOW_LINE )
positions.append( _createCurvedCandidate( slp, angle_avg, -mFeature->labelInfo->label_height - mFeature->distlabel ) );
// delete original candidate
delete slp;
}
}
int nbp = positions.size();
( *lPos ) = new LabelPosition*[nbp];
for ( int i = 0; i < nbp; i++ )
{
( *lPos )[i] = positions.takeFirst();
}
delete[] path_distances;
return nbp;
}
/*
* seg 2
* pt3 ____________pt2
* ¦ ¦
* ¦ ¦
* seg 3 ¦ BBOX ¦ seg 1
* ¦ ¦
* ¦____________¦
* pt0 seg 0 pt1
*
*/
int FeaturePart::setPositionForPolygon( LabelPosition ***lPos, PointSet *mapShape )
{
#ifdef _DEBUG_
std::cout << "SetPosition (polygon) : " << layer->name << "/" << uid << std::endl;
#endif
int i;
int j;
double labelWidth = mFeature->label_x;
double labelHeight = mFeature->label_y;
//print();
QLinkedList<PointSet*> shapes_toProcess;
QLinkedList<PointSet*> shapes_final;
mapShape->parent = NULL;
shapes_toProcess.append( mapShape );
splitPolygons( shapes_toProcess, shapes_final, labelWidth, labelHeight, mFeature->uid );
int nbp;
if ( shapes_final.size() > 0 )
{
QLinkedList<LabelPosition*> positions;
int id = 0; // ids for candidates
double dlx, dly; // delta from label center and bottom-left corner
double alpha = 0.0; // rotation for the label
double px, py;
double dx;
double dy;