-
Notifications
You must be signed in to change notification settings - Fork 145
/
Copy pathpattern.js
executable file
·1290 lines (1176 loc) · 54.1 KB
/
pattern.js
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
/**
* Created by amandaghassaei on 2/25/17.
*/
function initPattern(globals){
var FOLD = require('fold');
var foldData = {};
var rawFold = {};
function clearFold(){
foldData.vertices_coords = [];
foldData.edges_vertices = [];
foldData.edges_assignment = [];//B = boundary, M = mountain, V = valley, C = cut, F = facet, U = hinge
foldData.edges_foldAngle = [];//target angles
delete foldData.vertices_vertices;
delete foldData.faces_vertices;
delete foldData.vertices_edges;
rawFold = {};
}
var verticesRaw = [];
//refs to vertex indices
var mountainsRaw = [];
var valleysRaw = [];
var bordersRaw = [];
var cutsRaw = [];
var triangulationsRaw = [];
var hingesRaw = [];
var mountains = [];
var valleys = [];
var borders = [];
var hinges = [];
var triangulations = [];
var badColors = [];//store any bad colors in svg file to show user
function clearAll(){
clearFold();
verticesRaw = [];
mountainsRaw = [];
valleysRaw = [];
bordersRaw = [];
cutsRaw = [];
triangulationsRaw = [];
hingesRaw = [];
mountains = [];
valleys = [];
borders = [];
hinges = [];
triangulations = [];
badColors = [];
}
clearAll();
var SVGloader = new THREE.SVGLoader();
//filter for svg parsing
function borderFilter(){
var stroke = getStroke($(this));
return typeForStroke(stroke) == "border";
}
function mountainFilter(){
var $this = $(this);
var stroke = getStroke($this);
if (typeForStroke(stroke) == "mountain"){
var opacity = getOpacity($this);
this.targetAngle = -opacity*180;
return true;
}
return false;
}
function valleyFilter(){
var $this = $(this);
var stroke = getStroke($this);
if (typeForStroke(stroke) == "valley"){
var opacity = getOpacity($this);
this.targetAngle = opacity*180;
return true;
}
return false;
}
function cutFilter(){
var stroke = getStroke($(this));
return typeForStroke(stroke) == "cut";
}
function triangulationFilter(){
var stroke = getStroke($(this));
return typeForStroke(stroke) == "triangulation";
}
function hingeFilter(){
var stroke = getStroke($(this));
return typeForStroke(stroke) == "hinge";
}
function getOpacity(obj){
// Check rendered style first (most browsers, supporting CSS styling),
// then opacity attribute, then opacity:... spec in style attribute.
// Ditto for stroke-opacity. Both default to 1 (full opacity).
// If both are present, they get multiplied together.
var opacity = obj.css('opacity') || obj.attr('opacity') ||
(obj[0].style && obj[0].style.opacity);
var strokeOpacity = obj.css('stroke-opacity') ||
obj.attr('stroke-opacity') ||
(obj[0].style && obj[0].style.strokeOpacity);
opacity = parseFloat(opacity);
strokeOpacity = parseFloat(strokeOpacity);
if (isNaN(opacity)) {
opacity = 1;
}
if (isNaN(strokeOpacity)) {
opacity = 1;
}
return opacity * strokeOpacity;
}
function getStroke(obj){
// Check rendered style first (most browsers, supporting CSS styling),
// then stroke attribute, then stroke:... spec in style attribute.
var stroke = obj.css('stroke') || obj.attr("stroke") ||
(obj[0].style && obj[0].style.stroke);
if (stroke === undefined) {
return null;
}
stroke = stroke.replace(/\s/g,'');//remove all whitespace
return stroke.toLowerCase();
}
function typeForStroke(stroke){
if (stroke == "#000000" || stroke == "#000" || stroke == "black" || stroke == "rgb(0,0,0)") return "border";
if (stroke == "#ff0000" || stroke == "#f00" || stroke == "red" || stroke == "rgb(255,0,0)") return "mountain";
if (stroke == "#0000ff" || stroke == "#00f" || stroke == "blue" || stroke == "rgb(0,0,255)") return "valley";
if (stroke == "#00ff00" || stroke == "#0f0" || stroke == "green" || stroke == "rgb(0,255,0)") return "cut";
if (stroke == "#ffff00" || stroke == "#ff0" || stroke == "yellow" || stroke == "rgb(255,255,0)") return "triangulation";
if (stroke == "#ff00ff" || stroke == "#f0f" || stroke == "magenta" || stroke == "rgb(255,0,255)") return "hinge";
badColors.push(stroke);
return null;
}
function colorForAssignment(assignment){
if (assignment == "B") return "#000";//border
if (assignment == "M") return "#f00";//mountain
if (assignment == "V") return "#00f";//valley
if (assignment == "C") return "#0f0";//cut
if (assignment == "F") return "#ff0";//facet
if (assignment == "U") return "#f0f";//hinge
return "#0ff"
}
function opacityForAngle(angle, assignment){
if (angle === null || assignment == "F") return 1;
return Math.abs(angle)/180;
}
function findType(_verticesRaw, _segmentsRaw, filter, $paths, $lines, $rects, $polygons, $polylines){
parsePath(_verticesRaw, _segmentsRaw, $paths.filter(filter));
parseLine(_verticesRaw, _segmentsRaw, $lines.filter(filter));
parseRect(_verticesRaw, _segmentsRaw, $rects.filter(filter));
parsePolygon(_verticesRaw, _segmentsRaw, $polygons.filter(filter));
parsePolyline(_verticesRaw, _segmentsRaw, $polylines.filter(filter));
}
function applyTransformation(vertex, element){
var transformations = [];
var ancestor = element;
do {
if (ancestor.transform)
transformations.push.apply(transformations, ancestor.transform.baseVal);
ancestor = ancestor.parentNode;
} while (ancestor && ancestor.nodeName !== 'svg');
for (var i=0;i<transformations.length;i++){
var t = transformations[i];
var M = [[t.matrix.a, t.matrix.c, t.matrix.e], [t.matrix.b, t.matrix.d, t.matrix.f], [0,0,1]];
var out = numeric.dot(M, [vertex.x, vertex.z, 1]);
vertex.x = out[0];
vertex.z = out[1];
}
}
function parsePath(_verticesRaw, _segmentsRaw, $elements){
for (var i=0;i<$elements.length;i++){
var path = $elements[i];
var pathVertices = [];
if (path === undefined || path.getPathData === undefined){//mobile problem
var elm = '<div id="coverImg" ' +
'style="background: url(assets/doc/crane.gif) no-repeat center center fixed;' +
'-webkit-background-size: cover;' +
'-moz-background-size: cover;' +
'-o-background-size: cover;' +
'background-size: cover;">'+
'</div>';
$(elm).appendTo($("body"));
$("#noSupportModal").modal("show");
console.warn("path parser not supported");
return;
}
var startVertex = null;
var segments = path.getPathData();
for (var j=0;j<segments.length;j++){
var segment = segments[j];
var type = segment.type;
switch(type){
case "m"://dx, dy
var vertex;
if (j === 0){
// "If a relative moveto (m) appears as the first
// element of the path, then it is treated as a
// pair of absolute coordinates"
// [https://www.w3.org/TR/SVG/paths.html#PathDataMovetoCommands]
vertex = new THREE.Vector3(segment.values[0], 0, segment.values[1]);
} else {
vertex = _verticesRaw[_verticesRaw.length-1].clone();
vertex.x += segment.values[0];
vertex.z += segment.values[1];
}
startVertex = _verticesRaw.length;
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "l"://dx, dy
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
if (path.targetAngle && _segmentsRaw.length>0) _segmentsRaw[_segmentsRaw.length-1].push(path.targetAngle);
var vertex = _verticesRaw[_verticesRaw.length-1].clone();
vertex.x += segment.values[0];
vertex.z += segment.values[1];
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "v"://dy
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
if (path.targetAngle && _segmentsRaw.length>0) _segmentsRaw[_segmentsRaw.length-1].push(path.targetAngle);
var vertex = _verticesRaw[_verticesRaw.length-1].clone();
vertex.z += segment.values[0];
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "h"://dx
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
if (path.targetAngle && _segmentsRaw.length>0) _segmentsRaw[_segmentsRaw.length-1].push(path.targetAngle);
var vertex = _verticesRaw[_verticesRaw.length-1].clone();
vertex.x += segment.values[0];
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "M"://x, y
var vertex = new THREE.Vector3(segment.values[0], 0, segment.values[1]);
startVertex = _verticesRaw.length;
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "L"://x, y
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
if (path.targetAngle && _segmentsRaw.length>0) _segmentsRaw[_segmentsRaw.length-1].push(path.targetAngle);
var vertex = new THREE.Vector3(segment.values[0], 0, segment.values[1]);
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "V"://y
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
if (path.targetAngle && _segmentsRaw.length>0) _segmentsRaw[_segmentsRaw.length-1].push(path.targetAngle);
var vertex = _verticesRaw[_verticesRaw.length-1].clone();
vertex.z = segment.values[0];
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "H"://x
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
if (path.targetAngle && _segmentsRaw.length>0) _segmentsRaw[_segmentsRaw.length-1].push(path.targetAngle);
var vertex = _verticesRaw[_verticesRaw.length-1].clone();
vertex.x = segment.values[0];
_verticesRaw.push(vertex);
pathVertices.push(vertex);
break;
case "z":
case "Z":
if (startVertex != null) {
_segmentsRaw.push([_verticesRaw.length-1, startVertex]);
startVertex = null;
}
break;
}
}
for (var j=0;j<pathVertices.length;j++){
applyTransformation(pathVertices[j], path);
}
}
}
function parseLine(_verticesRaw, _segmentsRaw, $elements){
for (var i=0;i<$elements.length;i++){
var element = $elements[i];
_verticesRaw.push(new THREE.Vector3(element.x1.baseVal.value, 0, element.y1.baseVal.value));
_verticesRaw.push(new THREE.Vector3(element.x2.baseVal.value, 0, element.y2.baseVal.value));
_segmentsRaw.push([_verticesRaw.length-2, _verticesRaw.length-1]);
if (element.targetAngle) _segmentsRaw[_segmentsRaw.length-1].push(element.targetAngle);
applyTransformation(_verticesRaw[_verticesRaw.length-2], element);
applyTransformation(_verticesRaw[_verticesRaw.length-1], element);
}
}
function parseRect(_verticesRaw, _segmentsRaw, $elements){
for (var i=0;i<$elements.length;i++){
var element = $elements[i];
var x = element.x.baseVal.value;
var y = element.y.baseVal.value;
var width = element.width.baseVal.value;
var height = element.height.baseVal.value;
_verticesRaw.push(new THREE.Vector3(x, 0, y));
_verticesRaw.push(new THREE.Vector3(x+width, 0, y));
_verticesRaw.push(new THREE.Vector3(x+width, 0, y+height));
_verticesRaw.push(new THREE.Vector3(x, 0, y+height));
_segmentsRaw.push([_verticesRaw.length-4, _verticesRaw.length-3]);
_segmentsRaw.push([_verticesRaw.length-3, _verticesRaw.length-2]);
_segmentsRaw.push([_verticesRaw.length-2, _verticesRaw.length-1]);
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length-4]);
for (var j=1;j<=4;j++){
if (element.targetAngle) _segmentsRaw[_segmentsRaw.length-j].push(element.targetAngle);
applyTransformation(_verticesRaw[_verticesRaw.length-j], element);
}
}
}
function parsePolygon(_verticesRaw, _segmentsRaw, $elements){
for (var i=0;i<$elements.length;i++){
var element = $elements[i];
for (var j=0;j<element.points.length;j++){
_verticesRaw.push(new THREE.Vector3(element.points[j].x, 0, element.points[j].y));
applyTransformation(_verticesRaw[_verticesRaw.length-1], element);
if (j<element.points.length-1) _segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length]);
else _segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length-element.points.length]);
if (element.targetAngle) _segmentsRaw[_segmentsRaw.length-1].push(element.targetAngle);
}
}
}
function parsePolyline(_verticesRaw, _segmentsRaw, $elements){
for (var i=0;i<$elements.length;i++){
var element = $elements[i];
for (var j=0;j<element.points.length;j++){
_verticesRaw.push(new THREE.Vector3(element.points[j].x, 0, element.points[j].y));
applyTransformation(_verticesRaw[_verticesRaw.length-1], element);
if (j>0) {
_segmentsRaw.push([_verticesRaw.length-1, _verticesRaw.length-2]);
if (element.targetAngle) _segmentsRaw[_segmentsRaw.length-1].push(element.targetAngle);
}
}
}
}
function loadSVG(url, isDemo){
if (isDemo) {
gtag('event', 'demoFile', { 'CC': false });
} else {
gtag('event', 'uploadCP', { 'CC': false });
}
// Some SVG files start with UTF-8 byte order mark (BOM) EF BB BF,
// which encodes in Base64 to 77u/ -- remove this, as it breaks the
// XML/SVG parser.
url = url.replace(/^(data:image\/svg\+xml;base64,)77u\//, '$1');
SVGloader.load(url, function(svg){
var _$svg = $(svg);
if (_$svg.find('parsererror').length) {
globals.warn("Error parsing SVG: " + svg.innerText);
return console.warn(_$svg.find('parsererror')[0]);
}
// Add SVG to page dom to reveal rendered styles (including CSS).
$(svg).appendTo('body');
clearAll();
//warn of groups
// var $groups = _$svg.children("g");
// if ($groups.length>0){
// globals.warn("Grouped elements found in SVG, these are currently ignored by the app. " +
// "Please ungroup all elements before importing.");
// }
//format all appropriate svg elements
_$svg.find("symbol").remove();
_$svg.find("defs > :not(style)").remove();
var $paths = _$svg.find("path");
var $lines = _$svg.find("line");
var $rects = _$svg.find("rect");
var $polygons = _$svg.find("polygon");
var $polylines = _$svg.find("polyline");
$paths.css({fill:"none", 'stroke-dasharray':"none"});
$lines.css({fill:"none", 'stroke-dasharray':"none"});
$rects.css({fill:"none", 'stroke-dasharray':"none"});
$polygons.css({fill:"none", 'stroke-dasharray':"none"});
$polylines.css({fill:"none", 'stroke-dasharray':"none"});
findType(verticesRaw, bordersRaw, borderFilter, $paths, $lines, $rects, $polygons, $polylines);
findType(verticesRaw, mountainsRaw, mountainFilter, $paths, $lines, $rects, $polygons, $polylines);
findType(verticesRaw, valleysRaw, valleyFilter, $paths, $lines, $rects, $polygons, $polylines);
findType(verticesRaw, cutsRaw, cutFilter, $paths, $lines, $rects, $polygons, $polylines);
findType(verticesRaw, triangulationsRaw, triangulationFilter, $paths, $lines, $rects, $polygons, $polylines);
findType(verticesRaw, hingesRaw, hingeFilter, $paths, $lines, $rects, $polygons, $polylines);
if (badColors.length>0){
badColors = _.uniq(badColors);
var string = "Some objects found with the following stroke colors:<br/><br/>";
_.each(badColors, function(color){
string += "<span style='background:" + color + "' class='colorSwatch'></span>" + color + "<br/>";
});
string += "<br/>These objects were ignored.<br/> Please check that your file is set up correctly, <br/>" +
"see <b>File > Design Tips</b> for more information.";
globals.warn(string);
}
// Now that loading is done, remove SVG from page DOM.
_$svg.remove();
//todo revert back to old pattern if bad import
var success = parseSVG(verticesRaw, bordersRaw, mountainsRaw, valleysRaw, cutsRaw, triangulationsRaw, hingesRaw);
if (!success) return;
generateSvg();
},
function(){},
function(error){
globals.warn("Error loading SVG " + url + " : " + error);
console.warn(error);
});
}
function generateSvg() {
$("#svgViewer").empty();
//find max and min vertices
var max = new THREE.Vector3(-Infinity,-Infinity,-Infinity);
var min = new THREE.Vector3(Infinity,Infinity,Infinity);
for (var i=0;i<rawFold.vertices_coords.length;i++){
var vertex = new THREE.Vector3(rawFold.vertices_coords[i][0], rawFold.vertices_coords[i][1], rawFold.vertices_coords[i][2]);
max.max(vertex);
min.min(vertex);
}
if (min.x === Infinity){
if (badColors.length == 0) globals.warn("no geometry found in file");
return;
}
max.sub(min);
var border = new THREE.Vector3(0.1, 0, 0.1);
var scale = Math.max(max.x, max.y, max.z);
if (scale == 0) return;
var isCreasePattern = (rawFold.frame_classes && rawFold.frame_classes.includes('creasePattern')) | max.y < scale / 100;
if (!isCreasePattern) {
console.log('Fold data is not a crease pattern, skipping SVG generation');
return; // TODO try to flatten the folded state if possible
}
var strokeWidth = scale/300;
border.multiplyScalar(scale);
min.sub(border);
max.add(border.multiplyScalar(2));
var viewBoxTxt = min.x + " " + min.z + " " + max.x + " " + max.z;
var ns = 'http://www.w3.org/2000/svg';
var svg = document.createElementNS(ns, 'svg');
svg.setAttribute('viewBox', viewBoxTxt);
for (var i=0;i<rawFold.edges_vertices.length;i++){
var line = document.createElementNS(ns, 'line');
var edge = rawFold.edges_vertices[i];
var vertex = rawFold.vertices_coords[edge[0]];
line.setAttribute('stroke', colorForAssignment(rawFold.edges_assignment[i]));
line.setAttribute('opacity', opacityForAngle(rawFold.edges_foldAngle[i], rawFold.edges_assignment[i]));
line.setAttribute('x1', vertex[0]);
line.setAttribute('y1', vertex[2]);
vertex = rawFold.vertices_coords[edge[1]];
line.setAttribute('x2', vertex[0]);
line.setAttribute('y2', vertex[2]);
line.setAttribute('stroke-width', strokeWidth);
svg.appendChild(line);
}
$("#svgViewer").html(svg);
}
function parseSVG(_verticesRaw, _bordersRaw, _mountainsRaw, _valleysRaw, _cutsRaw, _triangulationsRaw, _hingesRaw){
_.each(_verticesRaw, function(vertex){
foldData.vertices_coords.push([vertex.x, vertex.z]);
});
_.each(_bordersRaw, function(edge){
foldData.edges_vertices.push([edge[0], edge[1]]);
foldData.edges_assignment.push("B");
foldData.edges_foldAngle.push(null);
});
_.each(_mountainsRaw, function(edge){
foldData.edges_vertices.push([edge[0], edge[1]]);
foldData.edges_assignment.push("M");
foldData.edges_foldAngle.push(edge[2]);
});
_.each(_valleysRaw, function(edge){
foldData.edges_vertices.push([edge[0], edge[1]]);
foldData.edges_assignment.push("V");
foldData.edges_foldAngle.push(edge[2]);
});
_.each(_triangulationsRaw, function(edge){
foldData.edges_vertices.push([edge[0], edge[1]]);
foldData.edges_assignment.push("F");
foldData.edges_foldAngle.push(0);
});
_.each(_hingesRaw, function(edge){
foldData.edges_vertices.push([edge[0], edge[1]]);
foldData.edges_assignment.push("U");
foldData.edges_foldAngle.push(null);
});
_.each(_cutsRaw, function(edge){
foldData.edges_vertices.push([edge[0], edge[1]]);
foldData.edges_assignment.push("C");
foldData.edges_foldAngle.push(null);
});
if (foldData.vertices_coords.length == 0 || foldData.edges_vertices.length == 0){
globals.warn("No valid geometry found in SVG, be sure to ungroup all and remove all clipping masks.");
return false;
}
foldData = FOLD.filter.collapseNearbyVertices(foldData, globals.vertTol);
foldData = FOLD.filter.removeLoopEdges(foldData);//remove edges that points to same vertex
foldData = FOLD.filter.removeDuplicateEdges_vertices(foldData);//remove duplicate edges
// foldData = FOLD.filter.subdivideCrossingEdges_vertices(foldData, globals.vertTol);//find intersections and add vertices/edges
foldData = findIntersections(foldData, globals.vertTol);
//cleanup after intersection operation
foldData = FOLD.filter.collapseNearbyVertices(foldData, globals.vertTol);
foldData = FOLD.filter.removeLoopEdges(foldData);//remove edges that points to same vertex
foldData = FOLD.filter.removeDuplicateEdges_vertices(foldData);//remove duplicate edges
foldData = FOLD.convert.edges_vertices_to_vertices_vertices_unsorted(foldData);
foldData = removeStrayVertices(foldData);//delete stray anchors
foldData = removeRedundantVertices(foldData, 0.01);//remove vertices that split edge
foldData.vertices_vertices = FOLD.convert.sort_vertices_vertices(foldData);
foldData = FOLD.convert.vertices_vertices_to_faces_vertices(foldData);
foldData = edgesVerticesToVerticesEdges(foldData);
foldData = removeBorderFaces(foldData);//expose holes surrounded by all border edges
foldData = reverseFaceOrder(foldData);//set faces to counter clockwise
return processFold(foldData);
}
function processFold(fold, returnCreaseParams){
//add missing coordinates to make 3d, mapping (x,y) -> (x,0,z)
//This is against the FOLD spec which says that, beyond two dimensions,
//"all unspecified coordinates are implicitly zero"...
var is2d = true;
for (var i=0;i<fold.vertices_coords.length;i++){
var vertex = fold.vertices_coords[i];
if (vertex.length === 2) {
fold.vertices_coords[i] = [vertex[0], 0, vertex[1]];
} else {
is2d = false;
}
}
//save pre-triangulated faces for later saveFOLD()
rawFold = JSON.parse(JSON.stringify(fold));
var cuts = FOLD.filter.cutEdges(fold);
if (cuts.length>0) {
fold = splitCuts(fold);
fold = FOLD.convert.edges_vertices_to_vertices_vertices_unsorted(fold);
fold = removeRedundantVertices(fold, 0.01);//remove vertices that split edge
}
delete fold.vertices_vertices;
delete fold.vertices_edges;
foldData = triangulatePolys(fold, is2d);
mountains = FOLD.filter.mountainEdges(foldData);
valleys = FOLD.filter.valleyEdges(foldData);
borders = FOLD.filter.boundaryEdges(foldData);
hinges = FOLD.filter.unassignedEdges(foldData);
triangulations = FOLD.filter.flatEdges(foldData);
$("#numMtns").html("(" + mountains.length + ")");
$("#numValleys").html("(" + valleys.length + ")");
$("#numFacets").html("(" + triangulations.length + ")");
$("#numBoundary").html("(" + borders.length + ")");
$("#numPassive").html("(" + hinges.length + ")");
var allCreaseParams = getFacesAndVerticesForEdges(foldData);//todo precompute vertices_faces
if (returnCreaseParams) return allCreaseParams;
globals.model.buildModel(foldData, allCreaseParams);
return foldData;
}
function reverseFaceOrder(fold){
for (var i=0;i<fold.faces_vertices.length;i++){
fold.faces_vertices[i].reverse();
}
return fold;
}
function edgesVerticesToVerticesEdges(fold){
var verticesEdges = [];
for (var i=0;i<fold.vertices_coords.length;i++){
verticesEdges.push([]);
}
for (var i=0;i<fold.edges_vertices.length;i++){
var edge = fold.edges_vertices[i];
verticesEdges[edge[0]].push(i);
verticesEdges[edge[1]].push(i);
}
fold.vertices_edges = verticesEdges;
return fold;
}
function facesVerticesToVerticesFaces(fold){
var verticesFaces = [];
for (var i=0;i<fold.vertices_coords.length;i++){
verticesFaces.push([]);
}
for (var i=0;i<fold.faces_vertices.length;i++){
var face = fold.faces_vertices[i];
for (var j=0;j<face.length;j++){
verticesFaces[face[j]].push(i);
}
}
fold.vertices_faces = verticesFaces;
return fold;
}
function sortVerticesEdges(fold){
for (var i=0;i<fold.vertices_vertices.length;i++){
var verticesVertices = fold.vertices_vertices[i];
var verticesEdges = fold.vertices_edges[i];
var sortedVerticesEdges = [];
for (var j=0;j<verticesVertices.length;j++){
var index = -1;
for (var k=0;k<verticesEdges.length;k++){
var edgeIndex = verticesEdges[k];
var edge = fold.edges_vertices[edgeIndex];
if (edge.indexOf(verticesVertices[j])>=0){
index = edgeIndex;
break;
}
}
if (index<0) console.warn("no matching edge found, fix this");
sortedVerticesEdges.push(index);
}
fold.vertices_edges[i] = sortedVerticesEdges;
}
return fold;
}
function splitCuts(fold){
fold = sortVerticesEdges(fold);
fold = facesVerticesToVerticesFaces(fold);
//go around each vertex and split cut in clockwise order
for (var i=0;i<fold.vertices_edges.length;i++){
var groups = [[]];
var groupIndex = 0;
var verticesEdges = fold.vertices_edges[i];
var verticesFaces = fold.vertices_faces[i];
for (var j=0;j<verticesEdges.length;j++){
var edgeIndex = verticesEdges[j];
var assignment = fold.edges_assignment[edgeIndex];
groups[groupIndex].push(edgeIndex);
if (assignment == "C"){
//split cut edge into two boundary edges
groups.push([fold.edges_vertices.length]);
groupIndex++;
var newEdgeIndex = fold.edges_vertices.length;
var edge = fold.edges_vertices[edgeIndex];
fold.edges_vertices.push([edge[0], edge[1]]);
fold.edges_assignment[edgeIndex] = "B";
fold.edges_foldAngle.push(null);
fold.edges_assignment.push("B");
//add new boundary edge to other vertex
var otherVertex = edge[0];
if (otherVertex == i) otherVertex = edge[1];
var otherVertexEdges = fold.vertices_edges[otherVertex];
var otherVertexEdgeIndex = otherVertexEdges.indexOf(edgeIndex);
otherVertexEdges.splice(otherVertexEdgeIndex, 0, newEdgeIndex);
} else if (assignment == "B"){
if (j==0 && verticesEdges.length>1){
//check if next edge is also boundary
var nextEdgeIndex = verticesEdges[1];
if (fold.edges_assignment[nextEdgeIndex] == "B"){
//check if this edge shares a face with the next
var edge = fold.edges_vertices[edgeIndex];
var otherVertex = edge[0];
if (otherVertex == i) otherVertex = edge[1];
var nextEdge = fold.edges_vertices[nextEdgeIndex];
var nextVertex = nextEdge[0];
if (nextVertex == i) nextVertex = nextEdge[1];
if (connectedByFace(fold, fold.vertices_faces[i], otherVertex, nextVertex)){
} else {
groups.push([]);
groupIndex++;
}
}
} else if (groups[groupIndex].length>1) {
groups.push([]);
groupIndex++;
}
}
}
if (groups.length <= 1) continue;
for (var k=groups[groupIndex].length-1;k>=0;k--){//put remainder of last group in first group
groups[0].unshift(groups[groupIndex][k]);
}
groups.pop();
for (var j=1;j<groups.length;j++){//for each extra group, assign new vertex
var currentVertex = fold.vertices_coords[i];
var vertIndex = fold.vertices_coords.length;
fold.vertices_coords.push(currentVertex.slice());//make a copy
var connectingIndices = [];
for (var k=0;k<groups[j].length;k++){//update edges_vertices
var edgeIndex = groups[j][k];
var edge = fold.edges_vertices[edgeIndex];
var otherIndex = edge[0];
if (edge[0] == i) {
edge[0] = vertIndex;
otherIndex = edge[1];
} else edge[1] = vertIndex;
connectingIndices.push(otherIndex);
}
if (connectingIndices.length<2) {
console.warn("problem here");
} else {
for (var k=1;k<connectingIndices.length;k++){//update faces_vertices
//i, k-1, k
var thisConnectingVertIndex = connectingIndices[k];
var previousConnectingVertIndex = connectingIndices[k-1];
var found = false;
for (var a=0;a<verticesFaces.length;a++){
var face = fold.faces_vertices[verticesFaces[a]];
var index1 = face.indexOf(thisConnectingVertIndex);
var index2 = face.indexOf(previousConnectingVertIndex);
var index3 = face.indexOf(i);
if (index1 >= 0 && index2 >= 0 && index3>=0 &&
(Math.abs(index1-index3) === 1 || Math.abs(index1-index3) === face.length-1) &&
(Math.abs(index2-index3) === 1 || Math.abs(index2-index3) === face.length-1)){
found = true;
face[index3] = vertIndex;
break;
}
}
if (!found) console.warn("problem here");
}
}
}
}
//these are all incorrect now
delete fold.vertices_faces;
delete fold.vertices_edges;
delete fold.vertices_vertices;
return fold;
}
function connectedByFace(fold, verticesFaces, vert1, vert2){
if (vert1 == vert2) return false;
for (var a=0;a<verticesFaces.length;a++){
var face = fold.faces_vertices[verticesFaces[a]];
if (face.indexOf(vert1) >= 0 && face.indexOf(vert2) >= 0){
return true;
}
}
return false;
}
function removeBorderFaces(fold){
for (var i=fold.faces_vertices.length-1;i>=0;i--){
var face = fold.faces_vertices[i];
var allBorder = true;
for (var j=0;j<face.length;j++){
var vertexIndex = face[j];
var nextIndex = j+1;
if (nextIndex >= face.length) nextIndex = 0;
var nextVertexIndex = face[nextIndex];
var connectingEdgeFound = false;
for (var k=0;k<fold.vertices_edges[vertexIndex].length;k++){
var edgeIndex = fold.vertices_edges[vertexIndex][k];
var edge = fold.edges_vertices[edgeIndex];
if ((edge[0] == vertexIndex && edge[1] == nextVertexIndex) ||
(edge[1] == vertexIndex && edge[0] == nextVertexIndex)){
connectingEdgeFound = true;
var assignment = fold.edges_assignment[edgeIndex];
if (assignment != "B"){
allBorder = false;
break;
}
}
}
if (!connectingEdgeFound) console.warn("no connecting edge found on face");
if (!allBorder) break;
}
if (allBorder) fold.faces_vertices.splice(i,1);
}
return fold;
}
function getFacesAndVerticesForEdges(fold){
var allCreaseParams = [];//face1Ind, vertInd, face2Ind, ver2Ind, edgeInd, angle
var faces = fold.faces_vertices;
for (var i=0;i<fold.edges_vertices.length;i++){
var assignment = fold.edges_assignment[i];
var angle = fold.edges_foldAngle[i];
if ((angle === null && !globals.foldUseAngles) || (assignment !== "M" && assignment !== "V" && assignment !== "F")) continue;
var edge = fold.edges_vertices[i];
var v1 = edge[0];
var v2 = edge[1];
var creaseParams = [];
for (var j=0;j<faces.length;j++){
var face = faces[j];
var faceVerts = [face[0], face[1], face[2]];
var v1Index = faceVerts.indexOf(v1);
if (v1Index>=0){
var v2Index = faceVerts.indexOf(v2);
if (v2Index>=0){
creaseParams.push(j);
if (v2Index>v1Index) {
faceVerts.splice(v2Index, 1);
faceVerts.splice(v1Index, 1);
} else {
faceVerts.splice(v1Index, 1);
faceVerts.splice(v2Index, 1);
}
creaseParams.push(faceVerts[0]);
if (creaseParams.length == 4) {
if (v2Index-v1Index == 1 || v2Index-v1Index == -2) {
creaseParams = [creaseParams[2], creaseParams[3], creaseParams[0], creaseParams[1]];
}
creaseParams.push(i);
creaseParams.push(angle);
allCreaseParams.push(creaseParams);
break;
}
}
}
}
}
return allCreaseParams;
}
function removeRedundantVertices(fold, epsilon){
var old2new = [];
var numRedundant = 0;
var newIndex = 0;
for (var i=0;i<fold.vertices_vertices.length;i++){
var vertex_vertices = fold.vertices_vertices[i];
if (vertex_vertices.length != 2) {
old2new.push(newIndex++);
continue;
}
var vertex_coord = fold.vertices_coords[i];
var neighbor0 = fold.vertices_coords[vertex_vertices[0]];
var neighbor1 = fold.vertices_coords[vertex_vertices[1]];
var threeD = vertex_coord.length == 3;
var vec0 = [neighbor0[0]-vertex_coord[0], neighbor0[1]-vertex_coord[1]];
var vec1 = [neighbor1[0]-vertex_coord[0], neighbor1[1]-vertex_coord[1]];
var magSqVec0 = vec0[0]*vec0[0]+vec0[1]*vec0[1];
var magSqVec1 = vec1[0]*vec1[0]+vec1[1]*vec1[1];
var dot = vec0[0]*vec1[0]+vec0[1]*vec1[1];
if (threeD){
vec0.push(neighbor0[2]-vertex_coord[2]);
vec1.push(neighbor1[2]-vertex_coord[2]);
magSqVec0 += vec0[2]*vec0[2];
magSqVec1 += vec1[2]*vec1[2];
dot += vec0[2]*vec1[2];
}
dot /= Math.sqrt(magSqVec0*magSqVec1);
if (Math.abs(dot + 1.0)<epsilon){
var merged = mergeEdge(fold, vertex_vertices[0], i, vertex_vertices[1]);
if (merged){
numRedundant++;
old2new.push(null);
} else {
old2new.push(newIndex++);
continue;
}
} else old2new.push(newIndex++);
}
if (numRedundant == 0) return fold;
console.warn(numRedundant + " redundant vertices found");
fold = FOLD.filter.remapField(fold, 'vertices', old2new);
if (fold.faces_vertices){
for (var i=0;i<fold.faces_vertices.length;i++){
var face = fold.faces_vertices[i];
for (var j=face.length-1;j>=0;j--){
if (face[j] === null) face.splice(j, 1);
}
}
}
return fold;
}
function mergeEdge(fold, v1, v2, v3){//v2 is center vertex
var angleAvg = 0;
var avgSum = 0;
var angles = [];
var edgeAssignment = null;
var edgeIndices = [];
for (var i=fold.edges_vertices.length-1;i>=0;i--){
var edge = fold.edges_vertices[i];
if (edge.indexOf(v2)>=0 && (edge.indexOf(v1) >= 0 || edge.indexOf(v3) >= 0)){
if (edgeAssignment === null) edgeAssignment = fold.edges_assignment[i];
else if (edgeAssignment != fold.edges_assignment[i]) {
console.log(edgeAssignment, fold.edges_assignment[i]);
console.warn("different edge assignments");
return false;
}
var angle = fold.edges_foldAngle[i];
if (isNaN(angle)) console.log(i);
angles.push(angle);
if (angle) {
angleAvg += angle;
avgSum++;
}
edgeIndices.push(i);//larger index in front
}
}
if (angles[0] != angles[1]){
console.warn("incompatible angles: " + JSON.stringify(angles));
}
for (var i=0;i<edgeIndices.length;i++){
var index = edgeIndices[i];
fold.edges_vertices.splice(index, 1);
fold.edges_assignment.splice(index, 1);
fold.edges_foldAngle.splice(index, 1);
}
fold.edges_vertices.push([v1, v3]);
fold.edges_assignment.push(edgeAssignment);
if (avgSum > 0) fold.edges_foldAngle.push(angleAvg/avgSum);
else fold.edges_foldAngle.push(null);
var index = fold.vertices_vertices[v1].indexOf(v2);
fold.vertices_vertices[v1].splice(index, 1);
fold.vertices_vertices[v1].push(v3);
index = fold.vertices_vertices[v3].indexOf(v2);
fold.vertices_vertices[v3].splice(index, 1);
fold.vertices_vertices[v3].push(v1);
return true;
}
function removeStrayVertices(fold){
if (!fold.vertices_vertices) {
console.warn("compute vertices_vertices first");
fold = FOLD.convert.edges_vertices_to_vertices_vertices_unsorted(fold);
}
var numStrays = 0;
var old2new = [];
var newIndex = 0;
for (var i=0;i<fold.vertices_vertices.length;i++){
if (fold.vertices_vertices[i] === undefined || fold.vertices_vertices[i].length==0) {
numStrays++;
old2new.push(null);
} else old2new.push(newIndex++);
}
if (numStrays == 0) return fold;
console.warn(numStrays+ " stray vertices found");
return FOLD.filter.remapField(fold, 'vertices', old2new);
}
function triangulatePolys(fold, is2d){
var vertices = fold.vertices_coords;
var faces = fold.faces_vertices;
var edges = fold.edges_vertices;
var foldAngles = fold.edges_foldAngle;
var assignments = fold.edges_assignment;
var triangulatedFaces = [];
for (var i=0;i<faces.length;i++){
var face = faces[i];
if (face.length == 3){
triangulatedFaces.push(face);
continue;
}
//check for quad and solve manually