All language subtitles for 020 The evaluator

af Afrikaans
sq Albanian
am Amharic
ar Arabic Download
hy Armenian
az Azerbaijani
eu Basque
be Belarusian
bn Bengali
bs Bosnian
bg Bulgarian
ca Catalan
ceb Cebuano
ny Chichewa
zh-CN Chinese (Simplified)
zh-TW Chinese (Traditional)
co Corsican
hr Croatian
cs Czech
da Danish
nl Dutch
en English
eo Esperanto
et Estonian
tl Filipino
fi Finnish
fr French
fy Frisian
gl Galician
ka Georgian
de German
el Greek
gu Gujarati
ht Haitian Creole
ha Hausa
haw Hawaiian
iw Hebrew
hi Hindi
hmn Hmong
hu Hungarian
is Icelandic
ig Igbo
id Indonesian
ga Irish
it Italian
ja Japanese
jw Javanese
kn Kannada
kk Kazakh
km Khmer
ko Korean
ku Kurdish (Kurmanji)
ky Kyrgyz
lo Lao
la Latin
lv Latvian
lt Lithuanian
lb Luxembourgish
mk Macedonian
mg Malagasy
ms Malay
ml Malayalam
mt Maltese
mi Maori
mr Marathi
mn Mongolian
my Myanmar (Burmese)
ne Nepali
no Norwegian
ps Pashto
fa Persian
pl Polish
pt Portuguese
pa Punjabi
ro Romanian
ru Russian
sm Samoan
gd Scots Gaelic
sr Serbian
st Sesotho
sn Shona
sd Sindhi
si Sinhala
sk Slovak
sl Slovenian
so Somali
es Spanish
su Sundanese
sw Swahili
sv Swedish
tg Tajik
ta Tamil
te Telugu
th Thai
tr Turkish
uk Ukrainian
ur Urdu
uz Uzbek
vi Vietnamese
cy Welsh
xh Xhosa
yi Yiddish
yo Yoruba
zu Zulu
or Odia (Oriya)
rw Kinyarwanda
tk Turkmen
tt Tatar
ug Uyghur
Would you like to inspect the original subtitles? These are the user uploaded subtitles that are being translated: 1 00:00:00.02 --> 00:00:02.05 - [Instructor] We now have the window locations 2 00:00:02.05 --> 00:00:04.04 and base geometry generated 3 00:00:04.04 --> 00:00:07.06 within our dynamo script from the inputs provided. 4 00:00:07.06 --> 00:00:09.09 Now let's take a look at the evaluator section 5 00:00:09.09 --> 00:00:11.00 of the script. 6 00:00:11.00 --> 00:00:13.02 Which is where we will provide the methods 7 00:00:13.02 --> 00:00:16.02 for the study to determine whether one generated option 8 00:00:16.02 --> 00:00:18.09 is better or worse than another. 9 00:00:18.09 --> 00:00:21.09 I currently have the exercise files open for this lesson. 10 00:00:21.09 --> 00:00:24.07 Which is where we left off from in the last lesson. 11 00:00:24.07 --> 00:00:27.06 So let's start by grouping the Curve.Points 12 00:00:27.06 --> 00:00:29.03 at eco segment length node, 13 00:00:29.03 --> 00:00:37.05 to indicate that it is a type of generator. 14 00:00:37.05 --> 00:00:40.03 Next let's look at the evaluator section 15 00:00:40.03 --> 00:00:43.03 underneath this evaluators title. 16 00:00:43.03 --> 00:00:46.00 There are two main metrics that we'll need to evaluate 17 00:00:46.00 --> 00:00:47.09 for each option generated. 18 00:00:47.09 --> 00:00:51.05 The first is how much length the windows have occupied 19 00:00:51.05 --> 00:00:53.00 along the wall. 20 00:00:53.00 --> 00:00:54.05 The intent of the study, 21 00:00:54.05 --> 00:00:58.02 is to maximize the amount of window length along the wall. 22 00:00:58.02 --> 00:01:01.00 So we need to compare the total wall length 23 00:01:01.00 --> 00:01:03.03 with the total window length. 24 00:01:03.03 --> 00:01:06.00 The smaller the difference, the closer the windows are 25 00:01:06.00 --> 00:01:08.05 to occupying the entire length of the wall. 26 00:01:08.05 --> 00:01:10.06 Of course if there are too many windows, 27 00:01:10.06 --> 00:01:11.07 there would be an overlap 28 00:01:11.07 --> 00:01:14.02 and the scale would be falsely low. 29 00:01:14.02 --> 00:01:16.09 Which is why we need the second evaluator. 30 00:01:16.09 --> 00:01:21.02 The second evaluator, is needed to calculate the overlap 31 00:01:21.02 --> 00:01:24.08 of the windows using the cuboids that we created 32 00:01:24.08 --> 00:01:29.03 in the last lesson. 33 00:01:29.03 --> 00:01:30.01 For example 34 00:01:30.01 --> 00:01:34.03 if we increase the number of wall segment lengths, 35 00:01:34.03 --> 00:01:37.00 eventually it will become one large mass 36 00:01:37.00 --> 00:01:39.03 which is not really what we want. 37 00:01:39.03 --> 00:01:41.02 Ideally, there is no overlap 38 00:01:41.02 --> 00:01:45.00 and a space between each window. 39 00:01:45.00 --> 00:01:47.01 So let's start with the first evaluator 40 00:01:47.01 --> 00:01:49.05 to determine the remaining length of the wall, 41 00:01:49.05 --> 00:01:52.07 once the windows are placed. 42 00:01:52.07 --> 00:01:55.04 For this we'll first need the length of the wall. 43 00:01:55.04 --> 00:01:59.01 And we can obtain that from using the Curve.Length node. 44 00:01:59.01 --> 00:02:01.07 To find this we can right click the canvas 45 00:02:01.07 --> 00:02:06.02 and search Curve.Length. 46 00:02:06.02 --> 00:02:09.02 For the input, let's use the location line of the wall, 47 00:02:09.02 --> 00:02:11.02 which we retrieved earlier 48 00:02:11.02 --> 00:02:15.05 coming from this Data.Remember node. 49 00:02:15.05 --> 00:02:17.06 From this length we need to subtract 50 00:02:17.06 --> 00:02:19.05 the total length of the windows. 51 00:02:19.05 --> 00:02:23.01 So for that let's first get the number of windows placed 52 00:02:23.01 --> 00:02:28.02 using a Count node. 53 00:02:28.02 --> 00:02:29.04 And we'll plug into that, 54 00:02:29.04 --> 00:02:32.08 the points that we generated earlier. 55 00:02:32.08 --> 00:02:35.07 So we can say there are 10 windows placed. 56 00:02:35.07 --> 00:02:37.06 To get the total length. 57 00:02:37.06 --> 00:02:41.04 We then need a Multiplication node. 58 00:02:41.04 --> 00:02:44.01 So we'll search Multiplication 59 00:02:44.01 --> 00:02:46.08 and we're going to multiply the number of windows 60 00:02:46.08 --> 00:02:49.00 by the selected window width 61 00:02:49.00 --> 00:02:56.01 which is coming from this List.GetItemAt index node. 62 00:02:56.01 --> 00:02:56.09 Perfect. 63 00:02:56.09 --> 00:03:00.06 So we have a total length of 4,060 millimeters 64 00:03:00.06 --> 00:03:05.07 for the windows and 8,750 for the wall length. 65 00:03:05.07 --> 00:03:08.02 Now we can subtract this wall length 66 00:03:08.02 --> 00:03:09.04 by the window length. 67 00:03:09.04 --> 00:03:16.06 To do that let's use a subtraction node. 68 00:03:16.06 --> 00:03:17.04 Great. 69 00:03:17.04 --> 00:03:20.00 So we have a value which we can optimize. 70 00:03:20.00 --> 00:03:22.09 Ideally, we want this to be as low as possible 71 00:03:22.09 --> 00:03:25.01 without the windows overlapping. 72 00:03:25.01 --> 00:03:26.09 So let's finish the logic for that. 73 00:03:26.09 --> 00:03:27.07 As we can see 74 00:03:27.07 --> 00:03:31.02 I've already set up most of the nodes for this section. 75 00:03:31.02 --> 00:03:33.02 The first two nodes are used to calculate 76 00:03:33.02 --> 00:03:36.09 the overall volume, of all of the windows. 77 00:03:36.09 --> 00:03:42.03 So if we plug the cuboids into the Solid.Volume node 78 00:03:42.03 --> 00:03:43.07 we get a value, 79 00:03:43.07 --> 00:03:47.05 which is the sum of each windows volume. 80 00:03:47.05 --> 00:03:51.08 The two nodes below, I used to first union the solids 81 00:03:51.08 --> 00:03:53.09 and then calculate the volume. 82 00:03:53.09 --> 00:03:58.01 So if we plug those cuboids into the Solid.By union node, 83 00:03:58.01 --> 00:04:01.04 we also get a value from the Solid.Volume node. 84 00:04:01.04 --> 00:04:03.08 Which is equal to the sum node. 85 00:04:03.08 --> 00:04:08.06 And this is because the windows are not overlapping. 86 00:04:08.06 --> 00:04:10.04 If it was to increase the number of windows, 87 00:04:10.04 --> 00:04:14.02 that they start to overlap, 88 00:04:14.02 --> 00:04:16.05 we can say that this number differs. 89 00:04:16.05 --> 00:04:19.02 This is because the Math.Sum node 90 00:04:19.02 --> 00:04:21.09 is summing all of the windows volumes. 91 00:04:21.09 --> 00:04:24.07 However the second Solid.Volume node, 92 00:04:24.07 --> 00:04:29.07 is first combining all of the windows to create one mass. 93 00:04:29.07 --> 00:04:33.03 Next we have an equal two node and a subtraction node. 94 00:04:33.03 --> 00:04:36.01 The equal node checks if these two nodes 95 00:04:36.01 --> 00:04:38.08 are outputting equal values. 96 00:04:38.08 --> 00:04:39.08 Currently they're not. 97 00:04:39.08 --> 00:04:41.07 So it's false. 98 00:04:41.07 --> 00:04:44.04 The subtraction node is used to determine 99 00:04:44.04 --> 00:04:47.06 the difference of these two nodes. 100 00:04:47.06 --> 00:04:52.00 These two values are then used with this if statement node. 101 00:04:52.00 --> 00:04:53.08 The if statement node will check 102 00:04:53.08 --> 00:04:56.03 if the two values are equal. 103 00:04:56.03 --> 00:04:59.05 If they are equal, meaning there's no overlap, 104 00:04:59.05 --> 00:05:02.03 then it'll output a value of zero. 105 00:05:02.03 --> 00:05:07.07 If they are not equal, it'll output this difference value. 106 00:05:07.07 --> 00:05:09.07 Because they are currently not equal, 107 00:05:09.07 --> 00:05:11.08 it is outputting that difference value. 108 00:05:11.08 --> 00:05:14.03 Ideally, we want this to be zero, 109 00:05:14.03 --> 00:05:16.05 meaning there's no overlap. 110 00:05:16.05 --> 00:05:18.00 Both of our evaluators, 111 00:05:18.00 --> 00:05:20.02 output a value which we can use to score 112 00:05:20.02 --> 00:05:22.04 each generated option. 113 00:05:22.04 --> 00:05:26.00 Ideally, we want the window to wall length to be low 114 00:05:26.00 --> 00:05:29.06 and we want the window overlap to be outputting zero. 115 00:05:29.06 --> 00:05:32.03 So next let's set up the outputs 116 00:05:32.03 --> 00:05:34.00 so that the study can assess them. 9135

Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.