-
Notifications
You must be signed in to change notification settings - Fork 13
/
PGS_Conversion.java
1960 lines (1817 loc) · 68.4 KB
/
PGS_Conversion.java
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
package micycle.pgs;
import static micycle.pgs.PGS.GEOM_FACTORY;
import static micycle.pgs.PGS.coordFromPVector;
import static micycle.pgs.color.ColorUtils.decomposeclrRGB;
import static processing.core.PConstants.BEZIER_VERTEX;
import static processing.core.PConstants.CURVE_VERTEX;
import static processing.core.PConstants.GROUP;
import static processing.core.PConstants.QUADRATIC_VERTEX;
import java.awt.Shape;
import java.awt.geom.AffineTransform;
import java.awt.geom.PathIterator;
import java.io.File;
import java.io.IOException;
import java.io.OutputStream;
import java.io.PrintStream;
import java.lang.reflect.Field;
import java.lang.reflect.InvocationTargetException;
import java.lang.reflect.Method;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
import org.apache.commons.io.FileUtils;
import org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D;
import org.jgrapht.alg.drawing.LayoutAlgorithm2D;
import org.jgrapht.alg.drawing.model.Box2D;
import org.jgrapht.alg.drawing.model.LayoutModel2D;
import org.jgrapht.alg.drawing.model.MapLayoutModel2D;
import org.jgrapht.alg.drawing.model.Point2D;
import org.jgrapht.alg.util.NeighborCache;
import org.jgrapht.graph.DefaultEdge;
import org.jgrapht.graph.SimpleGraph;
import org.jgrapht.graph.SimpleWeightedGraph;
import org.locationtech.jts.algorithm.Orientation;
import org.locationtech.jts.awt.ShapeReader;
import org.locationtech.jts.awt.ShapeWriter;
import org.locationtech.jts.geom.Coordinate;
import org.locationtech.jts.geom.CoordinateList;
import org.locationtech.jts.geom.Geometry;
import org.locationtech.jts.geom.LineString;
import org.locationtech.jts.geom.LinearRing;
import org.locationtech.jts.geom.Polygon;
import org.locationtech.jts.geom.PrecisionModel;
import org.locationtech.jts.geom.util.AffineTransformation;
import org.locationtech.jts.io.ParseException;
import org.locationtech.jts.io.WKBReader;
import org.locationtech.jts.io.WKBWriter;
import org.locationtech.jts.io.WKTReader;
import org.locationtech.jts.io.WKTWriter;
import org.locationtech.jts.io.geojson.GeoJsonReader;
import org.locationtech.jts.io.geojson.GeoJsonWriter;
import org.locationtech.jts.util.GeometricShapeFactory;
import org.scoutant.polyline.PolylineDecoder;
import it.rambow.master.javautils.PolylineEncoder;
import it.rambow.master.javautils.Track;
import it.rambow.master.javautils.Trackpoint;
import it.unimi.dsi.util.XoRoShiRo128PlusRandom;
import micycle.betterbeziers.CubicBezier;
import micycle.pgs.color.Colors;
import micycle.pgs.commons.Nullable;
import micycle.pgs.commons.PEdge;
import processing.core.PConstants;
import processing.core.PMatrix;
import processing.core.PShape;
import processing.core.PVector;
/**
* Facilitates conversion between <i>Processing's</i> {@code PShapes} and
* <i>JTS's</i> {@code Geometries}, along with various other formats. It also
* offers additional utility methods to assist with handling {@code PShapes}.
* <p>
* Though certain conversion methods are utilised internally by the library,
* they have been kept public to cater to more complex user requirements.
* <p>
* Note: JTS {@code Geometries} do not provide support for bezier curves. As
* such, bezier curves are linearised/divided into straight line segments during
* the conversion process from {@code PShape} to JTS {@code Geometry}.
* <p>
* Two configurable boolean flags influence the conversion process:
* {@link #PRESERVE_STYLE} (set to true by default), and
* {@link #HANDLE_MULTICONTOUR} (set to false by default). Users are encouraged
* to review these flags as part of more complicated workflows with this class.
*
* @author Michael Carleton
*/
public final class PGS_Conversion {
/** Approximate distance between successive sample points on bezier curves */
static final float BEZIER_SAMPLE_DISTANCE = 2;
private static Field MATRIX_FIELD, PSHAPE_FILL_FIELD;
/**
* A boolean flag that affects whether a PShape's style (fillColor, strokeColor,
* strokeWidth) is preserved during <code>PShape->Geometry->PShape</code>
* conversion (i.e. when <code>toPShape(fromPShape(myPShape))</code> is called).
* Default = <code>true</code>.
*/
public static boolean PRESERVE_STYLE = true;
/**
* A boolean flag that, when true, enables a specialised subroutine during the
* {@link #fromPShape(PShape) fromPShape()} conversion to correctly convert
* <b>single</b> PShapes comprised of multiple contours, each representing a
* separate shape. If set to <code>false</code>, the {@link #fromPShape(PShape)
* fromPShape()} method assumes that in multi-contour shapes, every contour
* beyond the first represents a hole, which is generally an adequate
* assumption.
* <p>
* This feature is disabled by default because it necessitates additional
* computation, such as determining polygon ring orientations, and is seldom
* required (unless one is dealing with fonts, I have observed). Default =
* <code>false</code>.
* <p>
* For more information, refer to the discussion on this topic at
* <a href="https://github.com/micycle1/PGS/issues/67">GitHub</a>.
*/
public static boolean HANDLE_MULTICONTOUR = false;
static {
try {
MATRIX_FIELD = PShape.class.getDeclaredField("matrix");
MATRIX_FIELD.setAccessible(true);
PSHAPE_FILL_FIELD = PShape.class.getDeclaredField("fillColor");
PSHAPE_FILL_FIELD.setAccessible(true);
} catch (NoSuchFieldException e) {
System.err.println(e.getLocalizedMessage());
}
}
private PGS_Conversion() {
}
/**
* Converts a JTS Geometry into a corresponding PShape. In the case of
* MultiGeometries (which include collections of geometries), the result is a
* GROUP PShape containing the appropriate child PShapes.
* <p>
* The conversion process follows the geometry types supported by JTS, namely:
* <ul>
* <li>{@link Geometry#TYPENAME_GEOMETRYCOLLECTION GEOMETRYCOLLECTION}:
* Converted to a GROUP PShape if it contains multiple geometries. For single
* geometry collections, it extracts and converts the single geometry.</li>
* <li>{@link Geometry#TYPENAME_MULTIPOLYGON MULTIPOLYGON}: Similar to
* GeometryCollection, MultiPolygons are converted to a GROUP PShape, with each
* polygon converted to a child PShape.</li>
* <li>{@link Geometry#TYPENAME_MULTILINESTRING MULTILINESTRING}:
* MultiLineStrings are handled in the same way as GeometryCollections and
* MultiPolygons, converted to a GROUP PShape containing child PShapes.</li>
* <li>{@link Geometry#TYPENAME_LINEARRING LINEARRING} and
* {@link Geometry#TYPENAME_LINESTRING LINESTRING}: These are converted to a
* PATH PShape, preserving the closed or open nature of the original
* LineString.</li>
* <li>{@link Geometry#TYPENAME_POLYGON POLYGON}: Converted to a PATH PShape,
* with each contour of the polygon represented as a series of vertices in the
* PShape. Inner contours, or 'holes' in the polygon, are handled
* separately.</li>
* <li>{@link Geometry#TYPENAME_POINT POINT} and
* {@link Geometry#TYPENAME_MULTIPOINT MULTIPOINT}: These are converted to a
* GEOMETRY PShape with each point represented as a vertex.</li>
* </ul>
* <p>
* Please note that any unsupported geometry types will result in an error
* message.
* <p>
* If {@link #PRESERVE_STYLE} is enabled and the geometry includes user data in
* the form of PShapeData, the style from the data is applied to the resulting
* PShape.
*
* @param g The JTS geometry to convert.
* @return A PShape that represents the input geometry, or a new, empty PShape
* if the input is null.
*/
public static PShape toPShape(final Geometry g) {
if (g == null) {
return new PShape();
}
PShape shape = new PShape();
// apply PGS style by default
shape.setFill(true);
shape.setFill(micycle.pgs.color.Colors.WHITE);
shape.setStroke(true);
shape.setStroke(micycle.pgs.color.Colors.PINK);
shape.setStrokeWeight(4);
shape.setStrokeJoin(PConstants.ROUND);
shape.setStrokeCap(PConstants.ROUND);
switch (g.getGeometryType()) {
case Geometry.TYPENAME_GEOMETRYCOLLECTION :
case Geometry.TYPENAME_MULTIPOLYGON :
case Geometry.TYPENAME_MULTILINESTRING :
if (g.getNumGeometries() == 1) {
shape = toPShape(g.getGeometryN(0));
} else {
shape.setFamily(GROUP);
for (int i = 0; i < g.getNumGeometries(); i++) {
shape.addChild(toPShape(g.getGeometryN(i)));
}
}
break;
// TODO treat closed linestrings as unfilled & unclosed paths?
case Geometry.TYPENAME_LINEARRING : // LinearRings are closed by definition
case Geometry.TYPENAME_LINESTRING : // LineStrings may be open
final LineString l = (LineString) g;
final boolean closed = l.isClosed();
shape.setFamily(PShape.PATH);
shape.beginShape();
Coordinate[] coords = l.getCoordinates();
for (int i = 0; i < coords.length - (closed ? 1 : 0); i++) {
shape.vertex((float) coords[i].x, (float) coords[i].y);
}
if (closed) { // closed vertex was skipped, so close the path
shape.endShape(PConstants.CLOSE);
} else {
// shape is more akin to an unconnected line: keep as PATH shape, but don't fill
// visually
shape.endShape();
shape.setFill(false);
}
break;
case Geometry.TYPENAME_POLYGON :
final Polygon polygon = (Polygon) g;
shape.setFamily(PShape.PATH);
shape.beginShape();
/*
* Outer and inner loops are iterated up to length-1 to skip the point that
* closes the JTS shape (same as the first point).
*/
coords = polygon.getExteriorRing().getCoordinates();
for (int i = 0; i < coords.length - 1; i++) {
final Coordinate coord = coords[i];
shape.vertex((float) coord.x, (float) coord.y);
}
for (int j = 0; j < polygon.getNumInteriorRing(); j++) { // holes
shape.beginContour();
coords = polygon.getInteriorRingN(j).getCoordinates();
for (int i = 0; i < coords.length - 1; i++) {
final Coordinate coord = coords[i];
shape.vertex((float) coord.x, (float) coord.y);
}
shape.endContour();
}
shape.endShape(PConstants.CLOSE);
break;
case Geometry.TYPENAME_POINT :
case Geometry.TYPENAME_MULTIPOINT :
coords = g.getCoordinates();
shape.setFamily(PShape.GEOMETRY);
shape.setFill(false);
shape.setStrokeCap(PConstants.ROUND);
shape.beginShape(PConstants.POINTS);
for (final Coordinate coord : coords) {
shape.vertex((float) coord.x, (float) coord.y);
}
shape.endShape();
break;
default :
System.err.println("PGS_Conversion Error: " + g.getGeometryType() + " geometry types are unsupported.");
break;
}
if (PRESERVE_STYLE && g.getUserData() != null && g.getUserData() instanceof PShapeData) {
PShapeData style = (PShapeData) g.getUserData();
style.applyTo(shape);
}
return shape;
}
/**
*
* Converts a collection of JTS Geometries into a corresponding GROUP PShape.
* This method loops through the provided geometries, converting each individual
* geometry into a PShape, and then adds it as a child to the GROUP PShape.
* <p>
* In case the collection only contains a single geometry, this method will
* instead return a PShape that directly corresponds to that single geometry. It
* will not be wrapped in a GROUP shape in this case.
*
* @param geometries A collection of JTS Geometries to convert into a PShape.
* @return A PShape that represents the collection of input geometries. If the
* collection contains only a single geometry, the return is a PShape
* directly equivalent to that geometry. Otherwise, the return is a
* GROUP PShape containing child PShapes for each geometry in the
* collection.
*/
public static PShape toPShape(Collection<? extends Geometry> geometries) {
PShape shape = new PShape(GROUP);
shape.setFill(true);
shape.setFill(micycle.pgs.color.Colors.WHITE);
shape.setStroke(true);
shape.setStroke(micycle.pgs.color.Colors.PINK);
shape.setStrokeWeight(4);
geometries.forEach(g -> shape.addChild(toPShape(g)));
if (shape.getChildCount() == 1) {
return shape.getChild(0);
}
return shape;
}
/**
*
* Transforms a PShape into a corresponding JTS Geometry.
* <p>
* During this transformation, any bezier curve elements within the input PShape
* are linearised, meaning they are sampled at regular, equidistant intervals.
* This process results in the created geometry having a greater number of
* vertices than the original PShape.
* <p>
* Additionally, please be aware that the method does not preserve multi-level
* child shape hierarchies present in the input PShape. All child shapes are
* flattened to the same level in the output geometry.
* <p>
* The conversion process depends on the PShape's type and can be broadly
* categorized as follows:
* <ul>
* <li>{@link PConstants#GROUP}: The method recursively converts each child of
* the PShape into a corresponding Geometry and groups these into a
* GeometryCollection.</li>
* <li>{@link PShape#GEOMETRY} and {@link PShape#PATH}: Here, the method further
* distinguishes between the kinds of the shape. For POLYGON, PATH and
* unspecified kinds, it creates a Geometry from the vertices of the PShape. For
* special paths (e.g., POINTS, LINES), it uses a separate conversion
* routine.</li>
* <li>{@link PShape#PRIMITIVE}: It converts the PShape using a separate routine
* dedicated to primitive shapes.</li>
* </ul>
* <p>
* If {@link #PRESERVE_STYLE} is enabled, the method preserves the style of the
* PShape in the output Geometry as user data.
* <p>
* Lastly, any affine transformations applied to the PShape (which do not
* directly affect its vertices) are also applied to the resulting Geometry
* (baked into its coordinates).
*
* @param shape The PShape to convert into a JTS Geometry.
* @return A JTS Geometry that corresponds to the input PShape, or an empty 2D
* Geometry if the PShape is null or the type of the PShape is
* unsupported.
*/
public static Geometry fromPShape(PShape shape) {
Geometry g = GEOM_FACTORY.createEmpty(2);
switch (shape.getFamily()) {
case PConstants.GROUP :
final List<PShape> flatChildren = getChildren(shape);
List<Geometry> geoChildren = flatChildren.stream().map(PGS_Conversion::fromPShape).collect(Collectors.toList());
g = GEOM_FACTORY.buildGeometry(geoChildren);
break;
case PShape.GEOMETRY :
case PShape.PATH :
if (shape.getKind() == PConstants.POLYGON || shape.getKind() == PConstants.PATH || shape.getKind() == 0) {
g = fromVertices(shape);
} else {
g = fromCreateShape(shape); // special paths (e.g. POINTS, LINES, etc.)
}
break;
case PShape.PRIMITIVE :
g = fromPrimitive(shape);
break;
}
if (PRESERVE_STYLE && g != null) {
g.setUserData(new PShapeData(shape));
}
/*
* Finally, apply PShape's affine transformations (which are not applied to its
* vertices directly).
*/
try {
final PMatrix matrix = (PMatrix) MATRIX_FIELD.get(shape);
if (matrix != null) { // is null if no affine transformations have been applied to shape
final float[] affine = matrix.get(null);
if (affine.length == 6) { // process 2D shape matrix only
AffineTransformation t = new AffineTransformation(affine[0], affine[1], affine[2], affine[3], affine[4], affine[5]);
return t.transform(g);
}
}
} catch (Exception e) {
}
return g;
}
/**
* Converts a PShape made via beginShape(KIND), where KIND is not POLYGON, to
* its equivalent JTS Geometry.
*
* @param shape
* @return
*/
private static Geometry fromCreateShape(PShape shape) {
switch (shape.getKind()) {
case PConstants.POINTS :
final Coordinate[] coords = new Coordinate[shape.getVertexCount()];
for (int i = 0; i < shape.getVertexCount(); i++) {
coords[i] = PGS.coordFromPVector(shape.getVertex(i));
}
return GEOM_FACTORY.createMultiPointFromCoords(coords);
case PConstants.LINES : // create multi line string consisting of each line
final LineString[] lines = new LineString[shape.getVertexCount() / 2];
for (int i = 0; i < lines.length; i++) {
final Coordinate c1 = PGS.coordFromPVector(shape.getVertex(2 * i));
final Coordinate c2 = PGS.coordFromPVector(shape.getVertex(2 * i + 1));
lines[i] = GEOM_FACTORY.createLineString(new Coordinate[] { c1, c2 });
}
return GEOM_FACTORY.createMultiLineString(lines);
case PConstants.TRIANGLE :
final Coordinate[] triangle = new Coordinate[3 + 1];
final Coordinate a = PGS.coordFromPVector(shape.getVertex(0));
triangle[0] = a;
triangle[1] = PGS.coordFromPVector(shape.getVertex(1));
triangle[2] = PGS.coordFromPVector(shape.getVertex(2));
triangle[3] = a.copy();
return GEOM_FACTORY.createPolygon(triangle);
case PConstants.TRIANGLES :
final Polygon[] triangles = new Polygon[shape.getVertexCount() / 3];
for (int i = 0; i < triangles.length; i++) {
final Coordinate c1 = PGS.coordFromPVector(shape.getVertex(3 * i));
final Coordinate c2 = PGS.coordFromPVector(shape.getVertex(3 * i + 1));
final Coordinate c3 = PGS.coordFromPVector(shape.getVertex(3 * i + 2));
triangles[i] = GEOM_FACTORY.createPolygon(new Coordinate[] { c1, c2, c3, c1 });
}
return GEOM_FACTORY.createMultiPolygon(triangles);
case PConstants.QUADS :
final Polygon[] quads = new Polygon[shape.getVertexCount() / 4];
for (int i = 0; i < quads.length; i++) {
final Coordinate c1 = PGS.coordFromPVector(shape.getVertex(4 * i));
final Coordinate c2 = PGS.coordFromPVector(shape.getVertex(4 * i + 1));
final Coordinate c3 = PGS.coordFromPVector(shape.getVertex(4 * i + 2));
final Coordinate c4 = PGS.coordFromPVector(shape.getVertex(4 * i + 3));
quads[i] = GEOM_FACTORY.createPolygon(new Coordinate[] { c1, c2, c3, c4, c1 });
}
return GEOM_FACTORY.createMultiPolygon(quads);
default :
System.err.println("PGS_Conversion Error: Unsupported PShape kind: " + shape.getKind());
return GEOM_FACTORY.createEmpty(2);
}
}
/**
* Creates a JTS Polygon from a geometry or path PShape, whose 'kind' is a
* polygon or path.
* <p>
* Note that repeated vertices are not preserved during conversion (to maximise
* compatibility with geometric algorithms).
*/
private static Geometry fromVertices(PShape shape) {
if (shape.getVertexCount() < 2) { // skip empty / point PShapes
return GEOM_FACTORY.createPolygon();
}
int[] rawVertexCodes = shape.getVertexCodes();
/*
* getVertexCodes() is null for P2D shapes with no contours created via
* createShape(), so need to instantiate array here.
*/
if (rawVertexCodes == null) {
rawVertexCodes = new int[shape.getVertexCount()];
Arrays.fill(rawVertexCodes, PConstants.VERTEX);
}
final int[] contourGroups = getContourGroups(rawVertexCodes);
final int[] vertexCodes = getVertexTypes(rawVertexCodes);
final List<CoordinateList> contours = new ArrayList<>(); // list of coords representing rings/contours
int lastGroup = -1;
for (int i = 0; i < shape.getVertexCount(); i++) {
if (contourGroups[i] != lastGroup) {
if (lastGroup == -1 && contourGroups[0] > 0) {
lastGroup = 0;
}
lastGroup = contourGroups[i];
contours.add(new CoordinateList());
}
/**
* Sample bezier curves at regular intervals to produce smooth Geometry
*/
switch (vertexCodes[i]) { // VERTEX, BEZIER_VERTEX, CURVE_VERTEX, or BREAK
case QUADRATIC_VERTEX :
contours.get(lastGroup).addAll(getQuadraticBezierPoints(shape.getVertex(i - 1), shape.getVertex(i),
shape.getVertex(i + 1), BEZIER_SAMPLE_DISTANCE), false);
i += 1;
continue;
case BEZIER_VERTEX : // aka cubic bezier
contours.get(lastGroup).addAll(getCubicBezierPoints(shape.getVertex(i - 1), shape.getVertex(i), shape.getVertex(i + 1),
shape.getVertex(i + 2), BEZIER_SAMPLE_DISTANCE), false);
i += 2;
continue;
default : // VERTEX
contours.get(lastGroup).add(coordFromPVector(shape.getVertex(i)), false);
break;
}
}
contours.forEach(contour -> {
if (shape.isClosed()) {
contour.closeRing();
}
});
final Coordinate[] outerCoords = contours.get(0).toCoordinateArray();
if (outerCoords.length == 0) {
return GEOM_FACTORY.createPolygon(); // empty polygon
} else if (outerCoords.length == 1) {
return GEOM_FACTORY.createPoint(outerCoords[0]);
} else if (outerCoords.length == 2) {
return GEOM_FACTORY.createLineString(outerCoords);
} else if (shape.isClosed()) { // closed geometry or path
if (HANDLE_MULTICONTOUR) { // handle single shapes that *may* represent multiple shapes over many contours
return fromMultiContourShape(contours, false, false);
} else { // assume all contours beyond the first represent holes
LinearRing outer = GEOM_FACTORY.createLinearRing(outerCoords); // should always be valid
LinearRing[] holes = new LinearRing[contours.size() - 1]; // Create linear ring for each hole in the shape
for (int j = 1; j < contours.size(); j++) {
final Coordinate[] innerCoords = contours.get(j).toCoordinateArray();
holes[j - 1] = GEOM_FACTORY.createLinearRing(innerCoords);
}
return GEOM_FACTORY.createPolygon(outer, holes);
}
} else { // not closed
return GEOM_FACTORY.createLineString(outerCoords);
}
}
/**
* <p>
* Transforms a {@code PShape} object, which might contain multiple contours
* representing several polygons (including nested polygons with holes), into a
* valid JTS representation.
* <p>
* The input shape may not be directly producible using JTS because JTS
* represents multiple polygons as separate objects within a
* {@code MultiGeometry}, resulting in a {@code GROUP} shape. However,
* Processing allows <b>single</b> {@code PATH} PShapes to include multiple
* contour groups, representing multiple polygons despite being considered a
* "single" shape.
* <p>
* The {@code PShape} does not carry information about which contours represent
* holes or how contours should be grouped to represent the same shapes. This
* method determines this internally.
*
* @param contours A {@code List} of contours/rings. The contour at
* {@code index==0} is assumed to be polygonal and considered an
* exterior ring.
* @param sort A boolean value determining whether to sort the contours by
* orientation (clockwise contours first), which can solve some
* complex cases.
* @param reverse A boolean value indicating whether to reverse the contour
* collection, which can also solve complex cases.
* @return Returns either a {@code Polygon} or {@code MultiPolygon} depending on
* the input shape.
*
* @see Geometry
* @see CoordinateList
*/
private static Geometry fromMultiContourShape(List<CoordinateList> contours, boolean sort, boolean reverse) {
if (reverse) {
Collections.reverse(contours);
}
if (sort) {
contours.sort((a, b) -> {
boolean aCW = !Orientation.isCCWArea(a.toCoordinateArray());
boolean bCW = !Orientation.isCCWArea(b.toCoordinateArray());
if (aCW == bCW) {
return 0;
} else if (aCW && !bCW) {
return -1;
} else {
return 1;
}
});
}
if (contours.isEmpty()) {
return GEOM_FACTORY.createPolygon();
} else if (contours.size() == 1) {
return GEOM_FACTORY.createPolygon(contours.get(0).toCoordinateArray());
} else {
boolean previousRingIsCCW = false;
boolean previousRingIsHole = false;
/*
* Each list entry (ring group) holds the exterior polygon ring at index 0,
* followed by any number of hole rings. Created rings follow JTS expected
* orientation: clockwise as polygon exterior ring orientation; anti-clockwise
* for holes.
*/
final List<List<LinearRing>> polygonRingGroups = new ArrayList<>();
/*
* Ideally, the hole that succeeds a polygon exterior would belong to that
* exterior. However, sometimes contours in valid PShapes aren't ordered in this
* fashion: it is possible to have four contours: a,b,1,2; where the exteriors
* (a & b) are followed by two holes (1 & 2), where hole 1 belongs to a and hole
* 2 belongs to b. Hence (to be really thorough), we must check that a hole is
* actually contained by the last contour, otherwise we associate it with the
* first exterior (working backwards) that contains it.
*/
for (int j = 0; j < contours.size(); j++) {
final Coordinate[] contourCoords = contours.get(j).toCoordinateArray();
LinearRing ring;
/*
* Measure contour orientation to determine whether the contour represents a
* hole (orientated opposite to previous polygon exterior) or a polygon exterior
* (orientated in same direction to previous contour).
*/
final boolean ringIsCCW = Orientation.isCCWArea(contourCoords);
final boolean switched = previousRingIsCCW != ringIsCCW;
previousRingIsCCW = ringIsCCW;
if (((switched && !previousRingIsHole) || (!switched && previousRingIsHole)) && j > 0) { // this ring is hole
if (switched) {
previousRingIsHole = true;
}
/*
* Find exterior that contains the hole (usually is most recent one).
*/
ring = GEOM_FACTORY.createLinearRing(contours.get(j).toCoordinateArray(ringIsCCW));
int checkContainsPolygonIndex = polygonRingGroups.size() - 1;
while (checkContainsPolygonIndex >= 0
&& !GEOM_FACTORY.createPolygon(polygonRingGroups.get(checkContainsPolygonIndex).get(0)).contains(ring)) {
checkContainsPolygonIndex--;
}
if (checkContainsPolygonIndex >= 0) {
polygonRingGroups.get(checkContainsPolygonIndex).add(ring);
} else {
if (!sort) {
if (!reverse) {
// retry and reverse contours, which can fix some cases
return fromMultiContourShape(contours, false, true);
}
// retry and sort by orientation, which can fix some cases (assuming CW exterior
// rings)
return fromMultiContourShape(contours, true, false);
} else {
System.err.println(String.format(
"PGS_Conversion Error: Shape contour #%s was identified as a hole but no existing exterior rings contained it.",
j));
}
}
} else { // this ring is new polygon (or explictly contour #1)
ring = GEOM_FACTORY.createLinearRing(contours.get(j).toCoordinateArray(!ringIsCCW));
if (previousRingIsHole) {
previousRingIsHole = false;
}
polygonRingGroups.add(new ArrayList<>());
polygonRingGroups.get(polygonRingGroups.size() - 1).add(ring);
}
}
/*
* Convert each ring group to their representative polygon.
*/
final List<Polygon> polygons = new ArrayList<>();
polygonRingGroups.forEach(perPolygonRings -> {
LinearRing[] holes = null;
if (perPolygonRings.size() > 1) { // has holes
holes = perPolygonRings.subList(1, perPolygonRings.size()).toArray(new LinearRing[0]);
}
polygons.add(GEOM_FACTORY.createPolygon(perPolygonRings.get(0), holes));
});
if (polygons.size() > 1) {
return GEOM_FACTORY.createMultiPolygon(polygons.toArray(new Polygon[0]));
} else {
return polygons.get(0);
}
}
}
/**
* Creates a JTS Polygon from a primitive PShape. Primitive PShapes are
* generated by invoking the <code>createShape()</code> method from Processing.
* <p>
* Supported primitives include POINT, LINE, TRIANGLE, QUAD, RECT, ELLIPSE, and
* ARC. Other types such as BOX and SPHERE (3D primitives), or any non-polygon
* primitives are not supported and will print an error message.
* <p>
* Primitive PShapes do not have directly accessible vertex data. This method
* generates equivalent JTS Polygons by accessing the shape's parameters (e.g.,
* width, height, coordinates) via the <code>getParam()</code> method.
* <p>
* In the event where a non-supported primitive is supplied, an empty JTS
* Polygon is returned.
*
* @param shape The primitive PShape to be converted to a JTS Polygon
* @return A JTS Geometry (Polygon) representing the input primitive PShape. For
* non-supported or non-polygon primitives, an empty JTS Polygon is
* returned.
*/
private static Geometry fromPrimitive(PShape shape) {
final GeometricShapeFactory shapeFactory = new GeometricShapeFactory();
switch (shape.getKind()) {
case PConstants.ELLIPSE :
final double a = shape.getParam(2) / 2d;
final double b = shape.getParam(3) / 2d;
final double perimeter = Math.PI * (3 * (a + b) - Math.sqrt((3 * a + b) * (a + 3 * b)));
if ((int) Math.ceil(perimeter / BEZIER_SAMPLE_DISTANCE) < 4) {
return GEOM_FACTORY.createPolygon();
}
shapeFactory.setNumPoints((int) Math.ceil(perimeter / BEZIER_SAMPLE_DISTANCE));
shapeFactory.setCentre(new Coordinate(shape.getParam(0), shape.getParam(1)));
shapeFactory.setWidth(a * 2);
shapeFactory.setHeight(b * 2);
return shapeFactory.createEllipse();
case PConstants.TRIANGLE :
Coordinate[] coords = new Coordinate[3 + 1];
Coordinate c1 = new Coordinate(shape.getParam(0), shape.getParam(1));
coords[0] = c1;
coords[1] = new Coordinate(shape.getParam(2), shape.getParam(3));
coords[2] = new Coordinate(shape.getParam(4), shape.getParam(5));
coords[3] = c1.copy(); // close loop
return GEOM_FACTORY.createPolygon(coords);
case PConstants.RECT :
final float w = shape.getParam(2);
final float h = shape.getParam(3);
shapeFactory.setCentre(new Coordinate(shape.getParam(0) + w / 2, shape.getParam(1) + h / 2));
shapeFactory.setNumPoints(4);
shapeFactory.setWidth(w);
shapeFactory.setHeight(h);
return shapeFactory.createRectangle();
case PConstants.QUAD :
coords = new Coordinate[4 + 1];
c1 = new Coordinate(shape.getParam(0), shape.getParam(1));
coords[0] = c1;
coords[1] = new Coordinate(shape.getParam(2), shape.getParam(3));
coords[2] = new Coordinate(shape.getParam(4), shape.getParam(5));
coords[3] = new Coordinate(shape.getParam(6), shape.getParam(7));
coords[4] = c1.copy(); // close loop
return GEOM_FACTORY.createPolygon(coords);
case PConstants.ARC :
shapeFactory.setCentre(new Coordinate(shape.getParam(0), shape.getParam(1)));
shapeFactory.setWidth(shape.getParam(2));
shapeFactory.setHeight(shape.getParam(3));
// circumference (if it was full circle)
final double circumference = Math.PI * Math.max(shape.getParam(2), shape.getParam(3));
shapeFactory.setNumPoints((int) Math.ceil(circumference / BEZIER_SAMPLE_DISTANCE));
return shapeFactory.createArcPolygon(-Math.PI / 2 + shape.getParam(4), shape.getParam(5));
case PConstants.POINT :
return GEOM_FACTORY.createPoint(new Coordinate(shape.getParam(0), shape.getParam(1)));
case PConstants.LINE :
System.err.print("Non-polygon primitives are not supported.");
break;
case PConstants.BOX :
case PConstants.SPHERE :
System.err.print("3D primitives are not supported.");
break;
default :
System.err.print(shape.getKind() + " primitives are not supported.");
}
return GEOM_FACTORY.createPolygon(); // empty polygon
}
/**
* Transforms a variable arg list of points into a POINTS PShape.
*
* @param vertices
* @return a POINTS PShape
* @since 1.4.0
*/
public static final PShape toPointsPShape(PVector... vertices) {
return toPointsPShape(Arrays.asList(vertices));
}
/**
* Transforms a list of points into a POINTS PShape.
*
* @since 1.2.0
*/
public static final PShape toPointsPShape(Collection<PVector> points) {
PShape shape = new PShape();
shape.setFamily(PShape.GEOMETRY);
shape.setStrokeCap(PConstants.ROUND);
shape.setStroke(true);
shape.setStroke(micycle.pgs.color.Colors.PINK);
shape.setStrokeWeight(6);
shape.beginShape(PConstants.POINTS);
points.forEach(p -> shape.vertex(p.x, p.y));
shape.endShape();
return shape;
}
/**
* Creates a PShape having circle geometries representing a collection of
* circles.
*
* @param circles The collection of PVector objects representing the circles.
* The x and y components represent the center of the circle, and
* the z component represents the radius.
* @return The PShape object representing the collection of circles.
* @since 1.4.0
*/
public static final PShape toCircles(Collection<PVector> circles) {
return toPShape(circles.stream().map(c -> PGS_Construction.createEllipse(c.x, c.y, c.z, c.z)).collect(Collectors.toList()));
}
/**
*
* Extracts the vertices of a PShape into a list of PVectors.
* <p>
* The function navigates through all children of the given shape if it is of
* the GROUP type, recursively flattening their vertices and adding them to the
* list. In the case of PShape primitives, where the <code>getVertex()</code>
* method fails, the shape is converted to its equivalent path representation
* before vertex extraction.
* <p>
* If the input shape represents a closed polygon, the method returns an
* "unclosed" version of the shape. This means that the duplicate vertex that
* closes the shape (which is identical to the first vertex) is omitted from the
* output.
* <p>
* The resulting list contains all vertices from the input PShape in the order
* they appear in the shape.
*
* @param shape the PShape from which vertices are to be extracted
* @return a list of PVector objects representing the vertices of the input
* shape
*/
public static List<PVector> toPVector(PShape shape) {
// use getChildren() incase shape is GROUP
final List<PVector> vertices = new ArrayList<>();
getChildren(shape).forEach(s -> {
if (s.getFamily() == PShape.PRIMITIVE) {
// getVertex() doesn't work on PShape primitives
s = toPShape(fromPrimitive(s));
}
for (int i = 0; i < s.getVertexCount(); i++) {
vertices.add(s.getVertex(i));
}
});
if (!vertices.isEmpty() && shape.getChildCount() > 0 && vertices.get(0).equals(vertices.get(vertices.size() - 1))) {
vertices.remove(vertices.size() - 1);
}
return vertices;
}
/**
* Transforms a given PShape into a simple graph representation. In this
* representation, the vertices of the graph correspond to the vertices of the
* shape, and the edges of the graph correspond to the edges of the shape. This
* transformation is specifically applicable to polygonal shapes where edges are
* formed by adjacent vertices.
* <p>
* The edge weights in the graph are set to the length of the corresponding edge
* in the shape.
*
* @param shape the PShape to convert into a graph
* @return A SimpleGraph object that represents the structure of the input shape
* @since 1.3.0
* @see #toDualGraph(PShape)
*/
public static SimpleGraph<PVector, PEdge> toGraph(PShape shape) {
final SimpleGraph<PVector, PEdge> graph = new SimpleWeightedGraph<>(PEdge.class);
for (PShape face : getChildren(shape)) {
for (int i = 0; i < face.getVertexCount() - (face.isClosed() ? 0 : 1); i++) {
final PVector a = face.getVertex(i);
final PVector b = face.getVertex((i + 1) % face.getVertexCount());
if (a.equals(b)) {
continue;
}
final PEdge e = new PEdge(a, b);
graph.addVertex(a);
graph.addVertex(b);
graph.addEdge(a, b, e);
graph.setEdgeWeight(e, e.length());
}
}
return graph;
}
/**
* Converts a given SimpleGraph consisting of PVectors and PEdges into a PShape
* by polygonizing its edges. If the graph represented a shape with holes, these
* will not be preserved during the conversion.
*
* @param graph the graph to be converted into a PShape.
* @return a PShape representing the polygonized edges of the graph.
* @since 1.4.0
*/
public static PShape fromGraph(SimpleGraph<PVector, PEdge> graph) {
return PGS.polygonizeEdges(graph.edgeSet());
}
/**
* Takes as input a graph and computes a layout for the graph vertices using a
* Force-Directed placement algorithm (not vertex coordinates, if any exist).
* Vertices are joined by their edges.
* <p>
* The output is a rather abstract representation of the input graph, and not a
* geometric equivalent (unlike most other conversion methods in the class).
*
* @param <V> any vertex type
* @param <E> any edge type
* @param graph the graph whose edges and vertices to lay out
* @param normalizationFactor normalization factor for the optimal distance,
* between 0 and 1.
* @param boundsX horizontal vertex bounds
* @param boundsY vertical vertex bounds
* @return a GROUP PShape consisting of 2 children; child 0 is the linework
* (LINES) depicting edges and child 1 is the points (POINTS) depicting
* vertices. The bounds of the layout are anchored at (0, 0);
* @since 1.3.0
*/
public static <V, E> PShape fromGraph(SimpleGraph<V, E> graph, double normalizationFactor, double boundsX, double boundsY) {
normalizationFactor = Math.min(Math.max(normalizationFactor, 0.001), 1);
LayoutAlgorithm2D<V, E> layout;
layout = new IndexedFRLayoutAlgorithm2D<>(50, 0.7, normalizationFactor, new XoRoShiRo128PlusRandom(1337));
LayoutModel2D<V> model = new MapLayoutModel2D<>(new Box2D(boundsX, boundsY));
layout.layout(graph, model);
NeighborCache<V, E> cache = new NeighborCache<>(graph);
Set<PEdge> edges = new HashSet<>(graph.edgeSet().size());
Map<V, PVector> pointMap = new HashMap<>();
model.forEach(a -> {
Point2D point = a.getValue();
pointMap.put(a.getKey(), new PVector((float) point.getX(), (float) point.getY()));
});
pointMap.keySet().forEach(v -> cache.neighborsOf(v).forEach(n -> edges.add(new PEdge(pointMap.get(v), pointMap.get(n)))));
PShape lines = PGS.prepareLinesPShape(null, null, null);
edges.forEach(e -> {
lines.vertex(e.a.x, e.a.y);
lines.vertex(e.b.x, e.b.y);
});
lines.endShape();
PShape pointsS = toPointsPShape(pointMap.values());
pointsS.setStrokeWeight(10);
return flatten(lines, pointsS);
}
/**
* Converts a mesh-like PShape into its undirected, unweighted dual-graph.
* <p>
* The output is a <i>dual graph</i> of the input; it has a vertex for each face
* (PShape) of the input, and an edge for each pair of faces that are adjacent.
*
* @param mesh a GROUP PShape, whose children constitute the polygonal faces of
* a <b>conforming mesh</b>. A conforming mesh consists of adjacent
* cells that not only share edges, but every pair of shared edges
* are identical (having the same coordinates) (such as a
* triangulation).
*
* @return the dual graph of the input mesh; an undirected graph containing no
* graph loops or multiple edges.
* @since 1.3.0
* @see #toGraph(PShape)
*/
public static SimpleGraph<PShape, DefaultEdge> toDualGraph(PShape mesh) {
return toDualGraph(getChildren(mesh));
}
/**
* Converts a mesh-like PShape into its centroid-based undirected dual-graph.
* <p>
* The output is a <i>dual graph</i> of the input; it has a vertex for each
* centroid of the face of the input, and an edge (connecting the centroids) for
* each pair of faces that are adjacent. Each vertex represents the geometric
* center or centroid of the respective face in the mesh.
*
* @param mesh a GROUP PShape, whose children constitute the polygonal faces of
* a <b>conforming mesh</b>. A conforming mesh consists of adjacent
* cells that not only share edges, but every pair of shared edges
* are identical (having the same coordinates) (such as a
* triangulation).
* @return the centroid-based dual graph of the input mesh; an undirected graph
* containing no graph loops or multiple edges. Each vertex in the graph
* represents the centroid of a face in the input mesh, and each edge
* represents adjacency between two faces.
* @since 1.4.0
* @see #toDualGraph(PShape)
* @see PGS_ShapePredicates#centroid(PShape)
*/
public static SimpleGraph<PVector, PEdge> toCentroidDualGraph(PShape mesh) {
final SimpleGraph<PShape, DefaultEdge> toplogy = toDualGraph(getChildren(mesh));
Map<PShape, PVector> centroids = toplogy.vertexSet().stream().collect(Collectors.toMap(x -> x, PGS_ShapePredicates::centroid));