-
Notifications
You must be signed in to change notification settings - Fork 0
/
Classes_ImageSource.cs
1821 lines (1626 loc) · 82.9 KB
/
Classes_ImageSource.cs
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
//'Pachyderm-Acoustic: Geometrical Acoustics for Rhinoceros (GPL) by Arthur van der Harten
//'
//'This file is part of Pachyderm-Acoustic.
//'
//'Copyright (c) 2008-2015, Arthur van der Harten
//'Pachyderm-Acoustic 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.
//'Pachyderm-Acoustic 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 Pachyderm-Acoustic; if not, write to the Free Software
//'Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
using System;
using System.Collections.Generic;
using Hare.Geometry;
using Pachyderm_Acoustic.Environment;
namespace Pachyderm_Acoustic
{
public class ImageSourceData:Simulation_Type
{
private List<Deterministic_Reflection>[]ValidPaths;
private List<Deterministic_Reflection>[,] ThreadPaths;
private double Speed_of_Sound;
private int MaxOrder;
private Source Src;
private Hare.Geometry.Point[] Rec;
private Polygon_Scene Room;
private int[] CurrentSrf;
private int[] CurrentEdge;
private DateTime ST;
private Random[] Rnd;
private double[] Direct_Time;
System.Threading.Thread[] T_List;
int processorCT;
int elementCt;
private TimeSpan TS;
private int SampleCT;
private int SampleRate;
public int SrcNo;
public int[] Oct_choice;
public bool Diffraction = false;
public bool IncludeEdges = false;
private ImageSourceData()
{
}
public ImageSourceData(Source Source, Receiver_Bank Receiver, Direct_Sound Direct, Polygon_Scene Rm, int MaxOrder_in, int SourceID_in)
:this(Source, Receiver, Direct, Rm, new int[2] { 0, 7 }, MaxOrder_in, false, SourceID_in)
{ }
public ImageSourceData(Source Source, Receiver_Bank Receiver, Direct_Sound Direct, Polygon_Scene Rm, int MaxOrder_in, bool ED, int SourceID_in)
: this(Source, Receiver, Direct, Rm, new int[2] { 0, 7 }, MaxOrder_in, ED, SourceID_in)
{ }
/// <summary>
/// Constructor prepares image source calculation to run.
/// </summary>
/// <param name="Source"></param>
/// <param name="Receiver"></param>
/// <param name="Direct"></param>
/// <param name="Rm"></param>
/// <param name="MaxOrder_in">The maximum order to be calculated for.</param>
public ImageSourceData(Source Source, Receiver_Bank Receiver, Direct_Sound Direct, Polygon_Scene Rm, int[] Octaves, int MaxOrder_in, bool Edge_Diffraction, int SourceID_in)
{
IncludeEdges = Edge_Diffraction;
Diffraction = Edge_Diffraction;
Oct_choice = new int[Octaves[1] - Octaves[0] + 1];
for (int i = 0; i < Octaves.Length; i++) Oct_choice[i] = i + Octaves[0];
SrcNo = SourceID_in;
ValidPaths = new List<Deterministic_Reflection>[Receiver.Count];
Speed_of_Sound = Rm.Sound_speed(0);
MaxOrder = MaxOrder_in;
Src = Source;
Rec = new Hare.Geometry.Point[Receiver.Count];
SampleCT = Receiver.SampleCT;
SampleRate = Receiver.SampleRate;
for(int i = 0; i < Receiver.Count; i++)
{
Rec[i] = Receiver.H_Origin(i);
}
Room = Rm;
Direct_Time = new double[Receiver.Count];
for (int q = 0; q < Receiver.Count; q++)
{
Direct_Time[q] = Direct.Min_Time(q);
}
}
/// <summary>
/// Called by Pach_RunSim_Command. Indicates whether or not the simulation has completed.
/// </summary>
/// <returns>Returns running if any threads in this simulation are still running. Returns stopped if all have stopped.</returns>
public override System.Threading.ThreadState ThreadState()
{
foreach (System.Threading.Thread T in T_List)
{
if (T.ThreadState == System.Threading.ThreadState.Running) return System.Threading.ThreadState.Running;
}
return System.Threading.ThreadState.Stopped;
}
/// <summary>
/// Inherited member. Divides the simulation into threads, and begins.
/// </summary>
public override void Begin()
{
processorCT = 4;
//processorCT = UI.PachydermAc_PlugIn.Instance.ProcessorSpec();
ThreadPaths = new List<Deterministic_Reflection>[Rec.Length, processorCT];
int SrfCT = Room.PlaneCount;
CurrentSrf = new int[processorCT];
CurrentEdge = new int[processorCT];
Rnd = new Random[processorCT];
T_List = new System.Threading.Thread[processorCT];
//elementCt = Room.PlaneCount + ((this.Diffraction) ? Room.EdgeCount : 0);
elementCt = Room.PlaneCount;
for (int P_I = 0; P_I < processorCT; P_I++)
{
for (int i = 0; i < Rec.Length; i++)
{
ThreadPaths[i,P_I] = new List<Deterministic_Reflection>();
ValidPaths[i] = new List<Deterministic_Reflection>();
}
int start = (int)Math.Floor((double)P_I * SrfCT / processorCT);
int end;
if (P_I == processorCT - 1) end = SrfCT;
else end = (P_I + 1) * SrfCT / processorCT;
Calc_Params T = new Calc_Params(start, end, P_I, Room.R_Seed.Next());
System.Threading.ParameterizedThreadStart TS = new System.Threading.ParameterizedThreadStart(delegate { Calculate(T); });
T_List[P_I] = new System.Threading.Thread(TS);
T_List[P_I].Start();
}
}
/// <summary>
/// Called by each thread from the begin method.
/// </summary>
/// <param name="i">the object is type "Calc_Params" which holds all the necessary information to run a portion of the simulation.</param>
public void Calculate(object i)
{
Calc_Params Params = (Calc_Params) i;
Rnd[Params.ThreadID] = new Random(Params.RandomSeed);
ST = DateTime.Now;
int[] Sequence = new int[1];
for (CurrentSrf[Params.ThreadID] = 0; CurrentSrf[Params.ThreadID] < Params.EndIndex - Params.StartIndex; CurrentSrf[Params.ThreadID]++)
{
List<Hare.Geometry.Point[]> Images = new List<Hare.Geometry.Point[]> {new Hare.Geometry.Point[1]};
Sequence[0] = CurrentSrf[Params.ThreadID] + Params.StartIndex;
Images[0][0] = Room.Image(Src.H_Origin(), 0, Room.PlaneMembers[Sequence[0]][0]);
//Process all valid first order reflections...
ProcessImages(Images.ToArray(), Sequence, Params.ThreadID);
//for (int j = 0; j < Rec.Length; j++) ProcessPath(Sequence, Params.ThreadID, j);
//Process higher order reflections (if needed)
//if (Diffraction)
//{
// LateOrdersED(1, Sequence, Params.ThreadID, Images);
//}
//else
//{
LateOrders(1, Sequence, Params.ThreadID, Images[0]);
//}
}
//if (!Diffraction) return;
////User has chosen to process edge reflections as well.
//int EdgeStart = (Room.EdgeCount * Params.ThreadID / (processorCT));
//int EdgeEnd = (Room.EdgeCount * (Params.ThreadID + 1) / (processorCT));
////int FS = 88200;
//for (CurrentEdge[Params.ThreadID] = EdgeStart; CurrentEdge[Params.ThreadID] < EdgeEnd; CurrentEdge[Params.ThreadID]++)
//{
// //Process all valid first order edge reflections...
// //Sequence[0] = CurrentEdge[Params.ThreadID] + EdgeStart;
// //List<double> P, T;
// //List<Vector> D;
// //List<Hare.Geometry.Point> Pt;
// //List<Hare.Geometry.Point> Src = new List<Hare.Geometry.Point>();
// Sequence[0] = CurrentEdge[Params.ThreadID] + Room.PlaneCount;
// List<Hare.Geometry.Point[]> Images = new List<Hare.Geometry.Point[]>();
// for (int j = 0; j < Room.Edge_Nodes[CurrentEdge[Params.ThreadID]].EdgeSources.Count; j++)
// {
// Images.Add(new Hare.Geometry.Point[1]{Room.Edge_Nodes[CurrentEdge[Params.ThreadID]].EdgeSources[j].Z_mid});
// }
// //Process all valid first order reflections...
// ProcessImages(Images.ToArray(), Sequence, Params.ThreadID);
// //Process higher order reflections (if needed)
// LateOrdersED(1, Sequence, Params.ThreadID, Images);
//}
}
/// <summary>
/// Used by specular raytracer.
/// </summary>
/// <param name="Sequences">List of surface index sequences to try.</param>
public void Lookup_Sequences(List<int[]>[] Sequences)
{
//processorCT = UI.PachydermAc_PlugIn.Instance.ProcessorSpec();
processorCT = 4;
ThreadPaths = new List<Deterministic_Reflection>[Rec.Length,processorCT];
int SrfCT = Room.PlaneCount;
CurrentSrf = new int[processorCT];
Random R = new Random();
T_List = new System.Threading.Thread[processorCT];
for (int p = 0; p < Rec.Length; p++)
{
for (int P_I = 0; P_I < processorCT; P_I++)
{
ThreadPaths[p, P_I] = new List<Deterministic_Reflection>();
Calc_Params T = new Calc_Params(P_I * Sequences[p].Count / processorCT, (P_I + 1) * Sequences[p].Count / processorCT, P_I, R.Next());
System.Threading.ParameterizedThreadStart TS = new System.Threading.ParameterizedThreadStart(delegate
{
for (int i = T.StartIndex; i < T.EndIndex; i++)
{
ProcessPath(Sequences[p][i], T.ThreadID, p);
}
});
T_List[P_I] = new System.Threading.Thread(TS);
T_List[P_I].Start();
}
do
{
System.Threading.Thread.Sleep(1000);
if (ThreadState() != System.Threading.ThreadState.Running) break;
} while (true);
for (int t = 0; t < processorCT; t++)
{
ValidPaths[p].AddRange(ThreadPaths[p, t]);
}
}
}
/// <summary>
/// A string to identify the type of simulation being run.
/// </summary>
/// <returns></returns>
public override string Sim_Type()
{
return "Image Source";
}
/// <summary>
/// Called by Pach_RunSim_Command. Get a string describing the status of the simulation for display.
/// </summary>
/// <returns></returns>
public override string ProgressMsg()
{
TS = DateTime.Now - ST;
int Srf_CT = 0;
for (int i = 0; i < processorCT; i++) Srf_CT += CurrentSrf[i];
//if (Diffraction)
//{
// int Edge_CT = 0;
// for (int i = 0; i < processorCT; i++) Edge_CT += CurrentEdge[i];
// TS = new TimeSpan((long)(TS.Ticks * (((double)(Room.PlaneCount - Srf_CT) + (Room.EdgeCount - Edge_CT)) / (Srf_CT + Edge_CT + 2))));
// return string.Format("Calculating Image/Edge Set {0} of {1}. ({2} hours,{3} minutes,{4} seconds Remaining.) Press 'Esc' to Cancel...", Srf_CT + Edge_CT, Room.PlaneCount + Room.EdgeCount, TS.Hours, TS.Minutes, TS.Seconds);
//}
//else
//{
TS = new TimeSpan((long)(TS.Ticks * (((double)(Room.PlaneCount - Srf_CT)) / (Srf_CT + 1))));
return string.Format("Calculating Image Set {0} of {1}. ({2} hours,{3} minutes,{4} seconds Remaining.) Press 'Esc' to Cancel...", Srf_CT, Room.PlaneCount, TS.Hours, TS.Minutes, TS.Seconds);
//}
}
/// <summary>
/// Aborts all threads, effectively ending the simulation.
/// </summary>
public override void Abort_Calculation()
{
foreach(System.Threading.Thread T in T_List) T.Abort();
}
/// <summary>
/// Consolidates output from all threads into a single set of output.
/// </summary>
public override void Combine_ThreadLocal_Results()
{
for (int i = 0; i < Rec.Length; i++)
{
for (int p = 0; p < processorCT; p++)
{
ValidPaths[i].AddRange(ThreadPaths[i, p]);
}
}
}
/// <summary>
/// Recursive function which carries out image source method for orders greater than 1.
/// </summary>
/// <param name="LastOrder">The order of the calling iteration.</param>
/// <param name="Sequence">The input sequence, to which the next surface will be appended.</param>
/// <param name="ThreadId">The id of the thread using the function.</param>
/// <param name="Images">the list of source images, to which the next image will be appended.</param>
private void LateOrders(int LastOrder, int[] Sequence, int ThreadId, Hare.Geometry.Point[] Images)
{
int CurrentOrder = LastOrder + 1;
Array.Resize(ref Sequence, Sequence.Length + 1);
Array.Resize(ref Images, Images.Length + 1);
bool GoNext = CurrentOrder < MaxOrder;
for (int q = 0; q < elementCt; q++)
{
if (q != Sequence[Sequence.Length - 2] && CurrentOrder <= MaxOrder)
{
Sequence[Sequence.Length - 1] = q;
Images[Images.Length - 1] = Room.Image(Images[Images.Length - 2], 0, Room.PlaneMembers[q][0]);
ProcessImages(new Hare.Geometry.Point[1][]{Images}, Sequence, ThreadId);
if (GoNext)
{
LateOrders(CurrentOrder, Sequence, ThreadId, Images);
}
}
}
}
/// <summary>
/// Recursive function which carries out image source/edge source method for orders greater than 1.
/// </summary>
/// <param name="LastOrder">The order of the calling iteration.</param>
/// <param name="Sequence">The input sequence, to which the next surface will be appended.</param>
/// <param name="ThreadId">The id of the thread using the function.</param>
/// <param name="Images">the list of source images, to which the next image will be appended.</param>
//private void LateOrdersED(int LastOrder, int[] Sequence, int ThreadId, List<Hare.Geometry.Point[]> Images0)
//{
// int CurrentOrder = LastOrder + 1;
// Array.Resize(ref Sequence, CurrentOrder);//Sequence.Length + 1);
// bool GoNext = CurrentOrder < MaxOrder;
// for (int q = 0; q < elementCt; q++)
// {
// List<Hare.Geometry.Point[]> Images = new List<Hare.Geometry.Point[]>();
// if (q != Sequence[Sequence.Length - 2] && CurrentOrder <= MaxOrder)
// {
// //int Current = Images0.Count;
// Sequence[LastOrder] = q;
// for(int r = 0; r < Images0.Count; r++)
// {
// Hare.Geometry.Point[] im = Images0[r].Clone() as Hare.Geometry.Point[];
// if (Sequence[q] > Room.PlaneCount - 1)
// {
// int edge_id = Sequence[q] - Room.PlaneCount;
// //Its an edge...
// //Hare.Geometry.Point[] im = Images0[r].Clone() as Hare.Geometry.Point[];
// for(int i = 0; i < Room.Edge_Nodes[edge_id].EdgeSources.Count; i++)
// {
// im[LastOrder] = Room.Edge_Nodes[edge_id].EdgeSources[i].Z_mid;
// Images.Add(im.Clone() as Hare.Geometry.Point[]);
// }
// //Room.Edge_Nodes[edge_id].EdgeSources
// }
// else
// {
// //Hare.Geometry.Point[] im = Images0[r].Clone() as Hare.Geometry.Point[];
// im[LastOrder] = Room.Image(Images[r][Images[r].Length - 2], 0, Room.PlaneMembers[q][0]);
// Images.Add(im);
// //Images[r][Images[r].Length - 1] = Room.Image(Images[r][Images[r].Length - 2], 0, Room.PlaneMembers[q][0]);
// }
// ProcessImages(Images.ToArray(), Sequence, ThreadId);
// if (GoNext)
// {
// LateOrdersED(CurrentOrder, Sequence, ThreadId, Images);
// }
// }
// }
// }
//}
/// <summary>
/// This function calculates the actual path of the specular reflection.
/// </summary>
/// <param name="Images">The list of images.</param>
/// <param name="Sequence">The list of surface indices for reflection.</param>
/// <param name="Threadid">The id of the calling thread.</param>
private void ProcessImages(Hare.Geometry.Point[][] Images, int[] Sequence, int Threadid)
{
for (int rec_id = 0; rec_id < Rec.Length; rec_id++)
{
double c_sound = Room.Sound_speed(Rec[rec_id]);
double[][] Trans_Mod = new double[Images.Length][];
int[] Seq_Polys = new int[Sequence.Length];
List<Hare.Geometry.Point[]> PathVertices = new List<Hare.Geometry.Point[]>();
Hare.Geometry.Point S = Src.H_Origin();
Hare.Geometry.Point E = Rec[rec_id];
double df = SampleRate * .5 / 8192;
//Find all Path Legs from Receiver to Source
for (int r = 0; r < Images.Length; r++)
{
Trans_Mod[r] = new double[8];
for (int t_oct = 0; t_oct < 8; t_oct++) Trans_Mod[r][t_oct] = 1;
Hare.Geometry.Point[] path = new Hare.Geometry.Point[Sequence.Length + 2];
path[0] = S;
path[path.Length - 1] = E;
for (int q = Sequence.Length - 1; q >= 0; q--)
{
if (Sequence[q] > Room.PlaneCount - 1)
{
//It's an edge!
int EdgeID = Sequence[q] - Room.PlaneCount;
//for (int i = 1; i < Room.Edge_Nodes[EdgeID].EdgeSources.Count; i++)
if (!OcclusionIntersectED(path[q + 2], Images[r][q], Sequence[q], ref Trans_Mod[r], ref path[q + 1], Threadid))// ref Trans_Mod, , ref Seq_Polys[q],
{
path = null;
break;
}
}
else
{
if (!OcclusionIntersect(path[q + 2], Images[r][q], Sequence[q], ref Trans_Mod[r], ref path[q + 1], ref Seq_Polys[q], Threadid))
{
path = null;
break;
}
}
}
PathVertices.Add(path);
}
//Check that any path was unoccluded... if so, then record this entry. If not, move on...
int goodct = 0;
foreach (Point[] item in PathVertices) if (item != null) {goodct++; break; };
if (goodct == 0) continue;
//Final Occlusion Check:
for (int r = 0; r < PathVertices.Count; r++)
{
if (PathVertices[r] == null) continue;
//if (Sequence[0] < Room.PlaneCount)
//{
if (FinalOcclusion(PathVertices[r][0], PathVertices[r][1], Sequence[0], ref Trans_Mod[r], Threadid))
PathVertices[r] = null;
//}
//else
//{
// int edge_id = Sequence[0] - Room.PlaneCount;
// if (FinalOcclusion(PathVertices[r][0], PathVertices[r][1], 0.00001, Room.Edge_Nodes[edge_id].ParentBreps[0], Room.Edge_Nodes[edge_id].ParentBreps[1], ref Trans_Mod[r], Threadid))
// PathVertices[r] = null;
//}
}
//Check again for null(occluded) paths...
goodct = 0;
foreach (Point[] item in PathVertices) if (item != null) { goodct++; break; };
if (goodct == 0) continue;
///Process all paths for pulse entry...
if (PathVertices.Count == 0) continue;//goto Next;
if (PathVertices.Count == 1)
{
ThreadPaths[rec_id, Threadid].Add(new Specular_Path(PathVertices[0], Sequence, Seq_Polys, Room, Src, Speed_of_Sound, Trans_Mod[0], ref Direct_Time[rec_id], Threadid, Rnd[Threadid].Next()));
continue;
}
//Process Compound Path before storing it.
//double[] H = new double[0];
//Environment.Material[] M = new Environment.Material[Sequence.Length];
//for (int i = 0; i < M.Length; i++) M[i] = (Sequence[i] < Room.PlaneCount) ? Room.Surface_Material(Sequence[i]) : null;
////Arrange all information to build filtered response...
//List<List<double>> Times = new List<List<double>>();
//List<List<double>> Pr = new List<List<double>>();
//List<double> Time = new List<double>();
//List<double> Bs = new List<double>();
//List<double> X = new List<double>();
//List<double> Y = new List<double>();
//List<double> Z = new List<double>();
//List<List<double>> Xe = new List<List<double>>();
//List<List<double>> Ye = new List<List<double>>();
//List<List<double>> Ze = new List<List<double>>();
//List<double> X_ = new List<double>();
//List<double> Y_ = new List<double>();
//List<double> Z_ = new List<double>();
//List<List<double>> Xs = new List<List<double>>();
//List<List<double>> Ys = new List<List<double>>();
//List<List<double>> Zs = new List<List<double>>();
//double deltaS = 0;
//double dt = 1.0f / SampleRate;
//List<double[]> t_limits = new List<double[]>();
// for (int i = 0; i < PathVertices.Count; i++)
// {
// if (PathVertices[i] == null)
// {
// if (Bs.Count > 0)
// {
// t_limits.Add(new double[2] { Time.Min(), Time.Max() });
// Pr.Add(Bs);
// Bs = new List<double>();
// Times.Add(Time);
// Time = new List<double>();
// Xe.Add(X);
// X = new List<double>();
// Ye.Add(Y);
// Y = new List<double>();
// Ze.Add(Z);
// Z = new List<double>();
// Xs.Add(X_);
// X_ = new List<double>();
// Ys.Add(Y_);
// Y_ = new List<double>();
// Zs.Add(Z_);
// Z_ = new List<double>();
// }
// continue;
// }
// double l = 0;
// double[] dm = null, dl = null;
// double length1 = 0, length2 = 0;
// double Pres = 1;
// int s, c, e;
// for (s = 0, c = 1, e = 2; e < PathVertices[i].Length; s++, c++, e++)
// {
// if (Sequence[s] < Room.PlaneCount)
// {
// length1 += (PathVertices[i][1] - PathVertices[i][c]).Length();
// length2 = length1;
// dl = new double[2] { (PathVertices[i][c] - PathVertices[i][e]).Length(), (PathVertices[i][c] - PathVertices[i][e]).Length() };
// }
// else if (Sequence[s] >= Room.PlaneCount)
// {
// double m = 0;
// double B = Room.Edge_Nodes[Sequence[s] - Room.PlaneCount].EdgeSources[i].Flex_Solve(PathVertices[i][s], PathVertices[i][e], ref m, ref l, ref dm, ref dl);
// Pres *= B;
// length1 += dm[0];
// length2 += dm[1];
// }
// else { throw new NotImplementedException("...well isn't that novel..."); }
// }
// length1 += dl[0];
// length2 += dl[1];
// double duration_s = SampleRate * Math.Abs(length2 - length1) / c_sound;
// Vector DIR;
// DIR = PathVertices[i][c-1] - PathVertices[i][e-1];
// DIR.Normalize();
// Pres /= duration_s;
// double Tn = 0.5 * (length1 + length2) / c_sound;
// if (Time.Count > 2)
// {
// double dtnew = Time[Time.Count - 2] - Tn;
// if (deltaS != 0 && (dtnew > 0) != (deltaS > 0))
// {
// //Break it...
// t_limits.Add(new double[2] { Time.Min(), Time.Max() });
// if (Bs.Last() < Pres) { t_limits[t_limits.Count - 1][0] += dt; }
// else { t_limits[t_limits.Count - 1][1] -= dt; }
// Pr.Add(Bs);
// Bs = new List<double>();
// Times.Add(Time);
// Time = new List<double>();
// Xe.Add(X);
// X = new List<double>();
// Ye.Add(Y);
// Y = new List<double>();
// Ze.Add(Z);
// Z = new List<double>();
// Xs.Add(X_);
// X_ = new List<double>();
// Ys.Add(Y_);
// Y_ = new List<double>();
// Zs.Add(Z_);
// Z_ = new List<double>();
// ///Ensure Continuity...
// //Time.Add(Times[Times.Count - 1].Last());
// //Bs.Add(Pr[Pr.Count - 1].Last());
// //X.Add(Xe[Xe.Count - 1].Last());
// //Y.Add(Ye[Ye.Count - 1].Last());
// //Z.Add(Ze[Ze.Count - 1].Last());
// //X_.Add(Xs[Xs.Count - 1].Last());
// //Y_.Add(Ys[Ys.Count - 1].Last());
// //Z_.Add(Zs[Zs.Count - 1].Last());
// //dtnew *= -1;
// }
// deltaS = dtnew;
// }
// Vector DIRs = PathVertices[i][1] - PathVertices[i][0];
// DIRs.Normalize();
// X_.Add(DIRs.x);
// Y_.Add(DIRs.y);
// Z_.Add(DIRs.z);
// Bs.Add(Pres);
// Time.Add(Tn);
// X.Add(DIR.x);
// Y.Add(DIR.y);
// Z.Add(DIR.z);
// }
// if (Bs.Count > 0)
// {
// t_limits.Add(new double[2] { Time.Min(), Time.Max() });
// Pr.Add(Bs);
// Times.Add(Time);
// Xe.Add(X);
// Ye.Add(Y);
// Ze.Add(Z);
// Xs.Add(X_);
// Ys.Add(Y_);
// Zs.Add(Z_);
// }
// MathNet.Numerics.Interpolation.CubicSpline[] Pr_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Pr.Count];
// MathNet.Numerics.Interpolation.CubicSpline[] X_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Xe.Count];
// MathNet.Numerics.Interpolation.CubicSpline[] Y_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Ye.Count];
// MathNet.Numerics.Interpolation.CubicSpline[] Z_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Ze.Count];
// MathNet.Numerics.Interpolation.CubicSpline[] Xs_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Xs.Count];
// MathNet.Numerics.Interpolation.CubicSpline[] Ys_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Ys.Count];
// MathNet.Numerics.Interpolation.CubicSpline[] Zs_Spline = new MathNet.Numerics.Interpolation.CubicSpline[Zs.Count];
// double min = double.PositiveInfinity;
// for (int i = 0; i < Times.Count; i++)
// {
// Pr_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Pr[i]);
// X_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Xe[i]);
// Y_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Ye[i]);
// Z_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Ze[i]);
// Xs_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Xs[i]);
// Ys_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Ys[i]);
// Zs_Spline[i] = MathNet.Numerics.Interpolation.CubicSpline.InterpolateAkima(Times[i], Zs[i]);
// min = Math.Min(min, t_limits[i][1]);
// }
// //TODO: Find a way to include absorption/transmission effects... which will not affect the entire multipath reflection...
// Dictionary<int, double> H_d = new Dictionary<int, double>();
// Dictionary<int, double>[] H_directional = new Dictionary<int, double>[6];
// for (int i = 0; i < 6; i++) H_directional[i] = new Dictionary<int, double>();
// for (int i = 0; i < t_limits.Count; i++)
// {
// for (double t = t_limits[i][0]; t < t_limits[i][1]; t += dt)
// {
// Vector dir = new Vector(Xs_Spline[i].Interpolate(t), Ys_Spline[i].Interpolate(t), Zs_Spline[i].Interpolate(t));
// ////Compose Impulse Response...
// //double T_current = (lengths[p_id] + dl[0]) / Room.Sound_speed(new Hare.Geometry.Point(0, 0, 0));
// //double T_duration = (length2 + dl[1]) / Room.Sound_speed(new Hare.Geometry.Point(0, 0, 0)) - T_current;
// ///Apply TransMod to TF...
// ///Each sample will have it's own unique air attenuation and occlusion conditions, which means that it needs to be treated individually for input signal (for air attenuation and absorption).
// //double[] TF = Audio.Pach_SP.Modulus_Filter(new double[8] { Math.Sqrt(Trans_Mod[p_id][0] * SW[0]), Math.Sqrt(Trans_Mod[p_id][1] * SW[1]), Math.Sqrt(Trans_Mod[p_id][2] * SW[2]), Math.Sqrt(Trans_Mod[p_id][3] * SW[3]), Math.Sqrt(Trans_Mod[p_id][4] * SW[4]), Math.Sqrt(Trans_Mod[p_id][5] * SW[5]), Math.Sqrt(Trans_Mod[p_id][6] * SW[6]), Math.Sqrt(Trans_Mod[p_id][7] * SW[7]) }, 44100, 8192, Threadid);
// double[] SW = Src.DirPower(Threadid, this.Rnd[Threadid].Next(), dir);
// foreach (Environment.Material m in M)
// {
// if (m is Environment.Basic_Material) for (int oct = 0; oct < 8; oct++)
// {
// SW[oct] *= 1 - m.Coefficient_A_Broad(oct);
// //SW[oct] *= Trans_Mod[j][oct];
// }
// }
// double[] ms = Audio.Pach_SP.Magnitude_Spectrum(new double[8] { Math.Sqrt(SW[0]), Math.Sqrt(SW[1]), Math.Sqrt(SW[2]), Math.Sqrt(SW[3]), Math.Sqrt(SW[4]), Math.Sqrt(SW[5]), Math.Sqrt(SW[6]), Math.Sqrt(SW[7]) }, 44100, 8192, Threadid);
// MathNet.Numerics.Complex[] TF = new MathNet.Numerics.Complex[ms.Length];
// for (int j = 0; j < TF.Length; j++) TF[j] = ms[j];
// //Array.Resize(ref TF, TF.Length / 2);
// ///Apply Air attenuation to TF...
// double[] atten = new double[0];
// double[] freq = new double[0];
// Room.AttenuationFilter(1024, 44100, t * c_sound, ref freq, ref atten, Rec[rec_id]);//sig is the magnitude response of the air attenuation filter...
// for (int j = 0; j < TF.Length; j++) TF[j] *= atten[j];
// for (int j = 0; j < M.Length; j++)
// {
// if (!(M[j] is Environment.Basic_Material))
// {
// MathNet.Numerics.Complex[] spec = M[j].Reflection_Spectrum(44100, 1024, Room.Normal(Sequence[j]), PathVertices[i][j] - PathVertices[i][j - 1], Threadid);
// for (int k = 0; k < TF.Length; k++) TF[k] *= spec[k];
// }
// }
// double[] prepulse = Audio.Pach_SP.IFFT_Real(Audio.Pach_SP.Mirror_Spectrum(TF), Threadid);
// double[] pulse = new double[prepulse.Length];
// Audio.Pach_SP.Scale(ref pulse);
// for (int j = 0; j < prepulse.Length; j++)
// {
// pulse[j] = prepulse[(j + prepulse.Length/2) % prepulse.Length];
// }
// //Audio.Pach_SP.Raised_Cosine_Window(ref pulse);
// //Manual convolution of each distinct contribution of edge...
// int index = (int)Math.Floor(t * SampleRate);
// double omni_pr = Pr_Spline[i].Interpolate(t);
// dir = new Vector(X_Spline[i].Interpolate(t), Y_Spline[i].Interpolate(t), Z_Spline[i].Interpolate(t));
// double[] dir_c = new double[6];
// if (dir.x > 0) dir_c[0] = dir.x; else dir_c[1] = -dir.x;
// if (dir.y > 0) dir_c[2] = dir.y; else dir_c[3] = -dir.y;
// if (dir.z > 0) dir_c[4] = dir.z; else dir_c[5] = -dir.z;
// for (int j = 0; j < pulse.Length; j++)
// {
// //Todo: confirm that pulse comes in at right times...
// int t_c = index + j;
// double p_t = omni_pr * pulse[j] / 8192;
// if (!H_d.Keys.Contains<int>(index + j))
// {
// H_d.Add(t_c, p_t);
// H_directional[0].Add(t_c, p_t * dir_c[0]);
// H_directional[1].Add(t_c, p_t * dir_c[1]);
// H_directional[2].Add(t_c, p_t * dir_c[2]);
// H_directional[3].Add(t_c, p_t * dir_c[3]);
// H_directional[4].Add(t_c, p_t * dir_c[4]);
// H_directional[5].Add(t_c, p_t * dir_c[5]);
// }
// else
// {
// H_d[t_c] += (float)(p_t);
// H_directional[0][t_c] += p_t * dir_c[0];
// H_directional[1][t_c] += p_t * dir_c[1];
// H_directional[2][t_c] += p_t * dir_c[2];
// H_directional[3][t_c] += p_t * dir_c[3];
// H_directional[4][t_c] += p_t * dir_c[4];
// H_directional[5][t_c] += p_t * dir_c[5];
// }
// }
// }
// }
// int minsample = H_d.Keys.Min();
// int maxsample = H_d.Keys.Max();
// double T0 = (double)minsample / SampleRate;
// H = new double[maxsample - minsample];
// double[][] Hdir = new double[6][];
// for(int j = 0; j < 6; j++) Hdir[j] = new double[maxsample - minsample];
// for (int j = minsample; j < maxsample; j++) if (H_d.Keys.Contains<int>(j))
// {
// H[j - minsample] = H_d[j];
// Hdir[0][j - minsample] = H_directional[0][j];
// Hdir[1][j - minsample] = H_directional[1][j];
// Hdir[2][j - minsample] = H_directional[2][j];
// Hdir[3][j - minsample] = H_directional[3][j];
// Hdir[4][j - minsample] = H_directional[4][j];
// Hdir[5][j - minsample] = H_directional[5][j];
// }
// ///Enter the reflection
// PathVertices.RemoveAll(item => item == null);
// ThreadPaths[rec_id, Threadid].Add(new Compound_Path(PathVertices.ToArray(), Sequence, Src.Source_ID(), H, Hdir, T0, Speed_of_Sound, ref Direct_Time[rec_id], Threadid));
}
}
/// <summary>
/// This function calculates the actual path of the specular reflection.
/// </summary>
/// <param name="Images">The list of images.</param>
/// <param name="Sequence">The list of surface indices for reflection.</param>
/// <param name="Threadid">The id of the calling thread.</param>
private void ProcessImages(Hare.Geometry.Point[] Images, int[] Sequence, int rec_id, int Threadid)
{
double[] Trans_Mod = new double[8];
int[] Seq_Polys = new int[Sequence.Length];
for (int t_oct = 0; t_oct < 8; t_oct++) Trans_Mod[t_oct] = 1;
Hare.Geometry.Point[] PathVertices = new Hare.Geometry.Point[Sequence.Length + 2];
PathVertices[0] = Src.H_Origin();
PathVertices[PathVertices.Length - 1] = Rec[rec_id];
//Find all Path Legs from Receiver to Source
for (int q = Sequence.Length; q > 0; q--) if (!OcclusionIntersect(PathVertices[q + 1], Images[q - 1], Sequence[q - 1], ref Trans_Mod, ref PathVertices[q], ref Seq_Polys[q - 1], Threadid)) return;
//Final Occlusion Check:
if (FinalOcclusion(PathVertices[0], PathVertices[1], Sequence[0], ref Trans_Mod, Threadid)) return;
Specular_Path SP = new Specular_Path(PathVertices, Sequence, Seq_Polys, Room, Src, Speed_of_Sound, Trans_Mod, ref Direct_Time[rec_id], Threadid, Rnd[Threadid].Next());
ThreadPaths[rec_id, Threadid].Add(SP);
}
/// <summary>
/// Processes image source paths with input of only a sequence of indices.
/// </summary>
/// <param name="Sequence">The input sequence of surface indices.</param>
/// <param name="Threadid">The id of the calling thread.</param>
/// <param name="rec_id">The id of the receiver.</param>
/// <returns>True if a valid path, false if not.</returns>
private bool ProcessPath(int[] Sequence, int Threadid, int rec_id)
{
Hare.Geometry.Point RefPoint;
Hare.Geometry.Point NextPoint = new Hare.Geometry.Point();
Hare.Geometry.Point[] Images = new Hare.Geometry.Point[Sequence.Length];
RefPoint = Src.H_Origin();
int[] Seq_Polys = new int[Sequence.Length];
double[] Trans_Mod = new double[8];
for (int t_oct = 0; t_oct < 8; t_oct++) Trans_Mod[t_oct] = 1;
//Find all Source Images
for (int q = 0; q < Sequence.Length; q++)
{
//RefPM = Room.PlaneMembers[Sequence[q]];
Images[q] = Room.Image(RefPoint, 0, Room.PlaneMembers[Sequence[q]][0]);
RefPoint = Images[q];
}
ProcessImages(Images, Sequence, rec_id, Threadid);
//Hare.Geometry.Point[] PathVertices = new Hare.Geometry.Point[Sequence.Length + 2];
//PathVertices[0] = Src.H_Origin();
//PathVertices[PathVertices.Length - 1] = Rec[rec_id];
//RefPoint = Rec[rec_id];
////Find all Path Legs from End to Start
//int Limit = Sequence.Length - 1;
//for (int q = Limit; q >= 0; q--)
//{
// if (!OcclusionIntersect(PathVertices[q + 2], Images[q], Sequence[q], ref Trans_Mod, ref RefPoint, ref Seq_Polys[q], Threadid))
// return false;
// PathVertices[q + 1] = RefPoint;
//}
////Final Occlusion Check:
//if (!FinalOcclusion(PathVertices[0], PathVertices[1], Sequence[0], ref Trans_Mod, ref RefPoint, Threadid))
// return false;
//Specular_Path SP = new Specular_Path(PathVertices, Sequence, Seq_Polys, Oct_choice, Room, Src, Speed_of_Sound, Trans_Mod, ref Direct_Time[rec_id], Threadid, Rnd[Threadid].Next());
//ThreadPaths[rec_id, Threadid].Add(SP);
return true;
}
/// <summary>
/// Checks a path for occlusions in the model.
/// </summary>
/// <param name="Src"></param>
/// <param name="EndPt"></param>
/// <param name="Poly_X"></param>
/// <param name="X_Point"></param>
/// <param name="Thread_Id">The id of the calling thread.</param>
/// <returns></returns>
private bool FinalOcclusion(Hare.Geometry.Point Src, Hare.Geometry.Point EndPt, int Poly_X, ref double[] Trans_Mod, int Thread_Id)
{
Hare.Geometry.Vector D = (Src - EndPt);
double L = D.Length();
double L2 = 0;
D.Normalize();
Ray R = new Ray(EndPt, D, Thread_Id, Rnd[Thread_Id].Next());
Hare.Geometry.X_Event X;
do
{
if (Room.shoot(R, 0, out X) && Room.IsTransmissive[X.Poly_id] && Poly_X != Room.PlaneID(X.Poly_id) && X.t < 0.001)
{
///The ray hit something transparent. Account for this...
double[] Absorption = Room.AbsorptionValue[X.Poly_id].Coefficient_A_Broad();
for (int oct = 0; oct < 8; oct++) Trans_Mod[oct] *= (1-Absorption[oct]) * Room.TransmissionValue[X.Poly_id][oct];
R.origin = X.X_Point;
R.Ray_ID = Rnd[Thread_Id].Next();
L2 += X.t;
continue;
}
break;
} while (true);
///If it hits nothing, then there is nothing occluding... IsOccluded = false
if (!X.Hit) return false;
///If the thing it hit is closer than the source, then it is occluded... IsOccluded = true
L2 += X.t;
if (L2 < L) return true;
///If we got this far, then there is nothing occluding...
return false;
}
//Edge Diffraction Version of the Final Occlusion Check.
private bool FinalOcclusion(Hare.Geometry.Point Src, Hare.Geometry.Point EndPt, double tol, int Poly_1, int Poly_2, ref double[] Trans_Mod, int Thread_Id)
{
Hare.Geometry.Vector D = (Src - EndPt);
double L = D.Length();
double L2 = 0;
D.Normalize();
Ray R = new Ray(EndPt, D, Thread_Id, Rnd[Thread_Id].Next());
Hare.Geometry.X_Event X;
do
{
////////////////////////////////////////////////////////////////////////////////////////////////////////
//Change this so that it checks for the edge the BREPS the edge is on when x.t is less than tolerance.
////////////////////////////////////////////////////////////////////////////////////////////////////////
if (Room.shoot(R, 0, out X) && (Room.IsTransmissive[X.Poly_id] || (X.t < tol && (Room.BrepID(X.Poly_id) == Poly_1 || Room.BrepID(X.Poly_id) == Poly_2))))//(Poly_2 != Room.PlaneID(X.Poly_id) || Poly_1 != Room.PlaneID(X.Poly_id)))
{
///The ray hit something transparent. Account for this...
double[] Absorption = Room.AbsorptionValue[X.Poly_id].Coefficient_A_Broad();
for (int oct = 0; oct < 8; oct++) Trans_Mod[oct] *= (1 - Absorption[oct]) * Room.TransmissionValue[X.Poly_id][oct];
R.origin = X.X_Point;
R.Ray_ID = Rnd[Thread_Id].Next();
L2 += X.t;
continue;
}
break;
} while (true);
///If it hits nothing, then there is nothing occluding... IsOccluded = false
if (!X.Hit) return false;
///If the thing it hit is closer than the source, then it is occluded... IsOccluded = true
L2 += X.t;
if (L2 < L) return true;
///If we got this far, then there is nothing occluding...
return false;
}
/// <summary>
/// Checks a path for occlusions in the model.
/// </summary>
/// <param name="Origin"></param>
/// <param name="EndPt"></param>
/// <param name="Poly_X"></param>
/// <param name="X_Point"></param>
/// <param name="Thread_Id">The id of the calling thread.</param>
/// <returns></returns>
private bool OcclusionIntersect(Hare.Geometry.Point Origin, Hare.Geometry.Point EndPt, int Poly_X, ref double[] Trans_Mod, ref Hare.Geometry.Point X_Point, ref int Poly_Seq, int Thread_Id)
{
Hare.Geometry.Vector D = (EndPt - Origin);
D.Normalize();
Ray R = new Ray(Origin, D, Thread_Id, Rnd[Thread_Id].Next());
Hare.Geometry.X_Event X = new Hare.Geometry.X_Event();
do
{
if (Room.shoot(R, 0, out X) && Room.IsTransmissive[X.Poly_id] && Poly_X != Room.PlaneID(X.Poly_id))
{
double[] Absorption = Room.AbsorptionValue[X.Poly_id].Coefficient_A_Broad();
for (int oct = 0; oct < 8; oct++) Trans_Mod[oct] *= (1 - Absorption[oct]) * Room.TransmissionValue[X.Poly_id][oct];
R.origin = X.X_Point;
R.Ray_ID = Rnd[Thread_Id].Next();
continue;
}
break;
} while (true);
if (X.t < 0.000001)
return false;
if (Poly_X != Room.PlaneID(X.Poly_id))
{
//Guid G1 = Rhino.RhinoDoc.ActiveDoc.Objects.Add(new LineCurve(Utilities.PachTools.HPttoRPt(X.x_Point), Utilities.PachTools.HPttoRPt(EndPt)));
//Guid G2 = Rhino.RhinoDoc.ActiveDoc.Objects.Add(new TextDot(Room.PlaneID(X.Poly_id).ToString(), Utilities.PachTools.HPttoRPt(EndPt)));
//Rhino.RhinoDoc.ActiveDoc.Groups.Add(new Guid[2] { G1, G2 });
return false;
}
Poly_Seq = X.Poly_id;
X_Point = X.X_Point;
return true;
}
/// <summary>
/// Checks a path for occlusions in the model.
/// </summary>
/// <param name="Origin"></param>
/// <param name="EndPt"></param>
/// <param name="Poly_X"></param>
/// <param name="X_Point"></param>
/// <param name="Thread_Id">The id of the calling thread.</param>
/// <returns></returns>
private bool OcclusionIntersectED(Hare.Geometry.Point Origin, Hare.Geometry.Point EndPt, int Poly_X, ref double[] Trans_Mod, ref Hare.Geometry.Point X_Point, int Thread_Id)//ref double[] Trans_Mod
{
Hare.Geometry.Vector D = (EndPt - Origin);
double L = D.Length();
D /= L;
Ray R = new Ray(Origin, D, Thread_Id, Rnd[Thread_Id].Next());
Hare.Geometry.X_Event X = new Hare.Geometry.X_Event();
do
{
if (Room.shoot(R, 0, out X) && Room.IsTransmissive[X.Poly_id])// && Poly_X != Room.PlaneID(X.Poly_id))
{
double[] Absorption = Room.AbsorptionValue[X.Poly_id].Coefficient_A_Broad();
for (int oct = 0; oct < 8; oct++) Trans_Mod[oct] *= (1 - Absorption[oct]) * Room.TransmissionValue[X.Poly_id][oct];
R.origin = X.X_Point;
R.Ray_ID = Rnd[Thread_Id].Next();
continue;
}
break;
} while (true);
if (X.t < L - 0.0001 && X.t != 0) return false;
//if (Poly_X != Room.PlaneID(X.Poly_id))
//{
// //Guid G1 = Rhino.RhinoDoc.ActiveDoc.Objects.Add(new LineCurve(Utilities.PachTools.HPttoRPt(X.x_Point), Utilities.PachTools.HPttoRPt(EndPt)));
// //Guid G2 = Rhino.RhinoDoc.ActiveDoc.Objects.Add(new TextDot(Room.PlaneID(X.Poly_id).ToString(), Utilities.PachTools.HPttoRPt(EndPt)));
// //Rhino.RhinoDoc.ActiveDoc.Groups.Add(new Guid[2] { G1, G2 });
// return false;
//}