<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Baiyao+Lin</id>
	<title>Medien Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Baiyao+Lin"/>
	<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/Special:Contributions/Baiyao_Lin"/>
	<updated>2026-05-24T05:47:11Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.6</generator>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=IFD:Kolloq_WS20&amp;diff=118275</id>
		<title>IFD:Kolloq WS20</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=IFD:Kolloq_WS20&amp;diff=118275"/>
		<updated>2020-11-12T15:43:41Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Anmeldung / Signup */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[:Category:Kolloquium|Kolloquium]] / Colloquium&#039;&#039;&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Instructors:&#039;&#039; Vertr.-Prof. [[Jason Reizner]], [[Clemens Wegener]], [[Brian Larson Clark]], [[Jesús Velázquez]]&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Credits:&#039;&#039; up to 6 [[ECTS]] (depending on the relevant study version), 2 [[SWS]]&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Capacity:&#039;&#039; two presenters per session&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Language:&#039;&#039; English/Deutsch&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;[[Zeitraster|Date]]:&#039;&#039; Wednesdays, 14:00-16:00&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Location:&#039;&#039; &amp;lt;s&amp;gt;Marienstrasse 7b, Room 104&amp;lt;/s&amp;gt; Online on BBB/Jitsi/Zoom&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;First Meeting:&#039;&#039; See schedule below.&lt;br /&gt;
&lt;br /&gt;
==Beschreibung / Description==&lt;br /&gt;
Das Interface-Design Kolloquium lädt unregelmäßig Mittwochs zu einem digitalen Vortrag aus der Praxis (von Studierenden, Gästen oder Mitarbeitern) ein. Im Anschluss wird über das Thema des Vortrags diskutiert.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Interface Design students, guests and lecturers are invited to digitally their works on selected Wednesdays. There will be a brief discussion afterwards.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Anmeldung / Registration ==&lt;br /&gt;
Der Besuch ist offen für alle IFD-Kandidaten und erfordert keine Anmeldung in BISON.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Participation is open to all IFD Candidates and does not require registration in BISON.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
==Zielgruppe / Target Group==&lt;br /&gt;
Alle IFD Bachelor- und Master-Studenten, Thesiskandidaten und Mitarbeiter der Professur Interface-Design.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;All IFD bachelor and master students, thesis candidates and staff of the Professorship of Interface Design.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Hinweise für Vortragende / Notes for Presenters ==&lt;br /&gt;
&lt;br /&gt;
Normalerweise gibt es zwei Redner pro Termin. Sie können Ihre Vortragssprache (Deutsch/Englisch) frei wählen. Es sind jedoch üblicherweise 40-60% fremdsprachige Teilnehmer anwesend, die i.d.R. besser Englisch als Deutsch verstehen. Die Präsentation sollte eine Dauer von etwa ~20 Minuten haben. Bitte haben Sie Verständnis dafür, wenn wir nach spätestens 30 Minuten abbrechen, denn wir möchten noch genügend Zeit für Feedback, Fragen und kurze Anschlussdiskussionen haben.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Typically two presentations will take place per session. The language of your presentation (German/English) is up to you to decide, although a significant portion (40-60%) of participants are non-native German speakers.&lt;br /&gt;
&lt;br /&gt;
The presentation should have a duration of about ~20 minutes. Please understand that we need to stop the talk after 30 minutes latest, in order to guarantee sufficient time for feedback, questions and short discussions.&lt;br /&gt;
&lt;br /&gt;
==Anmeldung / Signup==&lt;br /&gt;
&lt;br /&gt;
  BITTE MINIMAL + MAXIMAL ZWEI VORTRÄGE PRO TERMIN!&lt;br /&gt;
  DIE VERANSTALTUNG FINDET NUR STATT, WENN ES ZWEI VORTRÄGE GIBT!&lt;br /&gt;
&lt;br /&gt;
# 11.11.2020 &amp;lt;br/&amp;gt;Cancelled due to Fakultätsrat&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 18.11.2020 &amp;lt;br/&amp;gt;Irene López García / MFA MKG / Thesis Presentation: &amp;quot;Personal Data and Kinaesthetics: a learning user interface&amp;quot;&amp;lt;br/&amp;gt;Pratyusha Dutta / MFA MKG / Thesis Presentation: &amp;quot;Design and Prototype of a Customizable, Student-Centered Virtual Learning Interface&amp;quot;&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 25.11.2020 &amp;lt;br/&amp;gt;Cancelled due to Prüfungsausschuss&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 02.12.2020 &amp;lt;br/&amp;gt;Mina Mirzagholi / MFA MKG / Internship Presentation&amp;lt;br/&amp;gt;Presenter 2 Name / Program / Topic&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 09.12.2020 &amp;lt;br/&amp;gt;Baiyao Lin / MFA MKG / Thesis Presentation: &amp;quot;The Design for Data Middle Platform of Community-based Multi-Businesses&amp;quot;&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 13.01.2021 &amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 27.01.2021 &amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  MINIMUM + MAXIMUM TWO PRESENTATIONS PER SESSION!&lt;br /&gt;
  THE COLLOQUIUM WILL ONLY TAKE PLACE IF THERE ARE TWO PRESENTATIONS!&lt;br /&gt;
&lt;br /&gt;
== Previous Semesters ==&lt;br /&gt;
* [[IFD:Kolloq SoS20]]&lt;br /&gt;
* [[IFD:Kolloq WS19]]&lt;br /&gt;
* [[IFD:Kolloq SoS18]]&lt;br /&gt;
* [[IFD:Kolloq WS1718]]&lt;br /&gt;
* [[IFD:Kolloq SS17]]&lt;br /&gt;
* [[IFD:Kolloq WS16]]&lt;br /&gt;
* [[IFD:Kolloq SS16]]&lt;br /&gt;
* [[IFD:Kolloq WS15]]&lt;br /&gt;
* [[IFD:Kolloq SS15]]&lt;br /&gt;
* [[IFD:Kolloq WS14]]&lt;br /&gt;
* [[IFD:Kolloq SS14]]&lt;br /&gt;
* [[IFD:Kolloq WS13]]&lt;br /&gt;
* [[IFD:Kolloq SS12]]&lt;br /&gt;
* [[IFD:Kolloq WS12]]&lt;br /&gt;
* [[IFD:Kolloq SS13]]&lt;br /&gt;
&lt;br /&gt;
==Links==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:WS20]]&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=IFD:Kolloq_WS20&amp;diff=118270</id>
		<title>IFD:Kolloq WS20</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=IFD:Kolloq_WS20&amp;diff=118270"/>
		<updated>2020-11-12T15:16:06Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Anmeldung / Signup */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[:Category:Kolloquium|Kolloquium]] / Colloquium&#039;&#039;&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Instructors:&#039;&#039; Vertr.-Prof. [[Jason Reizner]], [[Clemens Wegener]], [[Brian Larson Clark]], [[Jesús Velázquez]]&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Credits:&#039;&#039; up to 6 [[ECTS]] (depending on the relevant study version), 2 [[SWS]]&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Capacity:&#039;&#039; two presenters per session&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Language:&#039;&#039; English/Deutsch&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;[[Zeitraster|Date]]:&#039;&#039; Wednesdays, 14:00-16:00&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;Location:&#039;&#039; &amp;lt;s&amp;gt;Marienstrasse 7b, Room 104&amp;lt;/s&amp;gt; Online on BBB/Jitsi/Zoom&amp;lt;br/&amp;gt;&lt;br /&gt;
&#039;&#039;First Meeting:&#039;&#039; See schedule below.&lt;br /&gt;
&lt;br /&gt;
==Beschreibung / Description==&lt;br /&gt;
Das Interface-Design Kolloquium lädt unregelmäßig Mittwochs zu einem digitalen Vortrag aus der Praxis (von Studierenden, Gästen oder Mitarbeitern) ein. Im Anschluss wird über das Thema des Vortrags diskutiert.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Interface Design students, guests and lecturers are invited to digitally their works on selected Wednesdays. There will be a brief discussion afterwards.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Anmeldung / Registration ==&lt;br /&gt;
Der Besuch ist offen für alle IFD-Kandidaten und erfordert keine Anmeldung in BISON.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Participation is open to all IFD Candidates and does not require registration in BISON.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
==Zielgruppe / Target Group==&lt;br /&gt;
Alle IFD Bachelor- und Master-Studenten, Thesiskandidaten und Mitarbeiter der Professur Interface-Design.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;All IFD bachelor and master students, thesis candidates and staff of the Professorship of Interface Design.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Hinweise für Vortragende / Notes for Presenters ==&lt;br /&gt;
&lt;br /&gt;
Normalerweise gibt es zwei Redner pro Termin. Sie können Ihre Vortragssprache (Deutsch/Englisch) frei wählen. Es sind jedoch üblicherweise 40-60% fremdsprachige Teilnehmer anwesend, die i.d.R. besser Englisch als Deutsch verstehen. Die Präsentation sollte eine Dauer von etwa ~20 Minuten haben. Bitte haben Sie Verständnis dafür, wenn wir nach spätestens 30 Minuten abbrechen, denn wir möchten noch genügend Zeit für Feedback, Fragen und kurze Anschlussdiskussionen haben.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Typically two presentations will take place per session. The language of your presentation (German/English) is up to you to decide, although a significant portion (40-60%) of participants are non-native German speakers.&lt;br /&gt;
&lt;br /&gt;
The presentation should have a duration of about ~20 minutes. Please understand that we need to stop the talk after 30 minutes latest, in order to guarantee sufficient time for feedback, questions and short discussions.&lt;br /&gt;
&lt;br /&gt;
==Anmeldung / Signup==&lt;br /&gt;
&lt;br /&gt;
  BITTE MINIMAL + MAXIMAL ZWEI VORTRÄGE PRO TERMIN!&lt;br /&gt;
  DIE VERANSTALTUNG FINDET NUR STATT, WENN ES ZWEI VORTRÄGE GIBT!&lt;br /&gt;
&lt;br /&gt;
# 11.11.2020 &amp;lt;br/&amp;gt;Cancelled due to Fakultätsrat&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 18.11.2020 &amp;lt;br/&amp;gt;Irene López García / MFA MKG / Thesis Presentation: &amp;quot;Personal Data and Kinaesthetics: a learning user interface&amp;quot;&amp;lt;br/&amp;gt;Pratyusha Dutta / MFA MKG / Thesis Presentation: &amp;quot;Design and Prototype of a Customizable, Student-Centered Virtual Learning Interface&amp;quot;&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 25.11.2020 &amp;lt;br/&amp;gt;Cancelled due to Prüfungsausschuss&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 02.12.2020 &amp;lt;br/&amp;gt;Mina Mirzagholi / MFA MKG / Internship Presentation&amp;lt;br/&amp;gt;Presenter 2 Name / Program / Topic&amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 09.12.2020 &amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;quot;A thesis presentation&amp;quot;&lt;br /&gt;
# 13.01.2021 &amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
# 27.01.2021 &amp;lt;br/&amp;gt;&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  MINIMUM + MAXIMUM TWO PRESENTATIONS PER SESSION!&lt;br /&gt;
  THE COLLOQUIUM WILL ONLY TAKE PLACE IF THERE ARE TWO PRESENTATIONS!&lt;br /&gt;
&lt;br /&gt;
== Previous Semesters ==&lt;br /&gt;
* [[IFD:Kolloq SoS20]]&lt;br /&gt;
* [[IFD:Kolloq WS19]]&lt;br /&gt;
* [[IFD:Kolloq SoS18]]&lt;br /&gt;
* [[IFD:Kolloq WS1718]]&lt;br /&gt;
* [[IFD:Kolloq SS17]]&lt;br /&gt;
* [[IFD:Kolloq WS16]]&lt;br /&gt;
* [[IFD:Kolloq SS16]]&lt;br /&gt;
* [[IFD:Kolloq WS15]]&lt;br /&gt;
* [[IFD:Kolloq SS15]]&lt;br /&gt;
* [[IFD:Kolloq WS14]]&lt;br /&gt;
* [[IFD:Kolloq SS14]]&lt;br /&gt;
* [[IFD:Kolloq WS13]]&lt;br /&gt;
* [[IFD:Kolloq SS12]]&lt;br /&gt;
* [[IFD:Kolloq WS12]]&lt;br /&gt;
* [[IFD:Kolloq SS13]]&lt;br /&gt;
&lt;br /&gt;
==Links==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:WS20]]&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=103568</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=103568"/>
		<updated>2019-01-19T23:16:26Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;used noise()&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;used loops, class, if statements&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;used the P3D renderer in a previous work&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm HGP 4 —  18.01.19==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:letter.jpg|400px]]&lt;br /&gt;
| Start the stopwatch on your phone, close your eyes at the same time, try to go through your whole yesterday in your mind, from get up to go to sleep. When finished, open your eyes and stop the time, mark the time as (xx) seconds. Look at the clock, mark the hour number as (yy). Look up the year (yyxx) in the wikipedia, mark down the first event as (s1). &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Go to the street, ask two people you come across, what their names are, when their birthdays are, and what numbers(p1 &amp;amp; p2) they love.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;For the first person, mark first name as (m). Look up the birthday year in the wikipedia, find the birth of this person&#039;s same date(take the next one following if none for this date). Mark down the birth&#039;s person&#039;s job occupation, e.g. French actor, mark actor. Search &amp;quot;actor&amp;quot; in the uni-libray system, find the first book in the list, turn to page &amp;quot;P1&amp;quot;, mark down the first sentence as (s2).&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;For the second person, search the first name(n) in the library system, find the second book in the list, turn to page (p2), mark down the last sentence as (s3).&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Fill the letter on the right page, with the names and sentences.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Leon&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Letter.jpg&amp;diff=103567</id>
		<title>File:Letter.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Letter.jpg&amp;diff=103567"/>
		<updated>2019-01-19T22:58:30Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102565</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102565"/>
		<updated>2018-12-31T13:30:45Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice —  07.12.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;used noise()&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;used loops, class, if statements&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;used the P3D renderer in a previous work&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102564</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102564"/>
		<updated>2018-12-31T13:29:19Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice —  07.12.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;used noise()&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;used class, if statements&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;used the P3D renderer in a previous work&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102563</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102563"/>
		<updated>2018-12-31T13:27:19Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice —  14.12.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;used noise()&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;used class&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;used the P3D renderer in a previous work&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102562</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102562"/>
		<updated>2018-12-31T13:26:04Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice —  07.12.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;used noise()&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;used class&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102561</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102561"/>
		<updated>2018-12-31T13:25:07Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;used noise()&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102560</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102560"/>
		<updated>2018-12-31T13:23:03Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice &amp;amp; HGP 2 —  9.11.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;used arrays, random()&amp;lt;br&amp;gt;inspired by moon pictures&amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102559</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102559"/>
		<updated>2018-12-31T12:53:54Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* 2D Grid Structure — 2.11.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;used  grid for loops, pushMatrix(), popMatrix(), translate(), rotate(), sin(), cos() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102558</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102558"/>
		<updated>2018-12-31T12:39:15Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice 1 — 26.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt; used 2D shapes, colors, setup(), draw() &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102253</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102253"/>
		<updated>2018-12-21T10:51:41Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  14.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:round1.jpg|400px]][[File:round3.jpg|400px]][[File:round4.jpg|400px]][[File:round2.jpg|400px]]&lt;br /&gt;
| Practice with P3D in previous work. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:round.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round.pde&amp;diff=102252</id>
		<title>File:Round.pde</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round.pde&amp;diff=102252"/>
		<updated>2018-12-21T10:50:50Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round4.jpg&amp;diff=102251</id>
		<title>File:Round4.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round4.jpg&amp;diff=102251"/>
		<updated>2018-12-21T10:50:00Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round3.jpg&amp;diff=102250</id>
		<title>File:Round3.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round3.jpg&amp;diff=102250"/>
		<updated>2018-12-21T10:49:59Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round2.jpg&amp;diff=102249</id>
		<title>File:Round2.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round2.jpg&amp;diff=102249"/>
		<updated>2018-12-21T10:49:59Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round1.jpg&amp;diff=102248</id>
		<title>File:Round1.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Round1.jpg&amp;diff=102248"/>
		<updated>2018-12-21T10:49:59Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102247</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=102247"/>
		<updated>2018-12-21T10:07:17Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice —  07.12.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:class1.png|400px]][[File:class2.png|400px]]&lt;br /&gt;
| Practice with class. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[:File:classproj.pde]][[:File:conte.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Conte.pde&amp;diff=102246</id>
		<title>File:Conte.pde</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Conte.pde&amp;diff=102246"/>
		<updated>2018-12-21T10:05:40Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Classproj.pde&amp;diff=102245</id>
		<title>File:Classproj.pde</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Classproj.pde&amp;diff=102245"/>
		<updated>2018-12-21T10:05:39Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Class2.png&amp;diff=102244</id>
		<title>File:Class2.png</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Class2.png&amp;diff=102244"/>
		<updated>2018-12-21T10:05:39Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Class1.png&amp;diff=102243</id>
		<title>File:Class1.png</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Class1.png&amp;diff=102243"/>
		<updated>2018-12-21T10:05:39Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101266</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101266"/>
		<updated>2018-11-23T19:36:46Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Jonas&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101265</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101265"/>
		<updated>2018-11-23T19:34:46Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:antarctic.jpg|400px]]&lt;br /&gt;
| Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Antarctic.jpg&amp;diff=101264</id>
		<title>File:Antarctic.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Antarctic.jpg&amp;diff=101264"/>
		<updated>2018-11-23T19:29:25Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101263</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101263"/>
		<updated>2018-11-23T19:26:22Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called Arccry, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16&amp;amp;23.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| &lt;br /&gt;
| *Open google map to search a bus stop(a) near you, then search a bus stop(b) near you, go to (b). Write down the time you arrive as (x)[xxh:xxm:xxs].&amp;lt;br&amp;gt;*Choose a bus on the messageboard, write down the bus number, how many minutes(m) it will arrive, and wait for the bus.&amp;lt;br&amp;gt;*Count the number of people in and out separately, get on the bus. Caculate a new number(n)=|num[in]-num[out]|, get off the bus at the (n)th stop. Write down the time you get off as (y)[yyh:yym:yys].&amp;lt;br&amp;gt;*Now check your compass on the phone, use the bus&#039; leaving direction to record the compass direction as (z)[N, E, S, or W].&amp;lt;br&amp;gt;*Turn the time (x), (y) into coordinate, eg. 24h:24m:24s -&amp;gt;24°24&#039;24&amp;quot;. Caculate a new coordinate(nx, 2my), nx as altitude, 2my as longitude. If the bus stop(b) is to the north of (a), set altitude as |nx|, and set as -|nx| if south. So you can check on northern or southern hemisphere; If the bus number is even, set longitude as |2my|, and set as -|2my| if it&#039;s odd, so you can check on the east or west to the 0° longitude line.&amp;lt;br&amp;gt;*Look up the new coordinate on google map, if it is in a city, write down the city and country name, if it&#039;s not in a city, use the direction(z) to look for the nearest city on this direction, write down the names.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101078</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101078"/>
		<updated>2018-11-16T11:10:09Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice &amp;amp; HGP 3 —  9.11.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  16.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101077</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=101077"/>
		<updated>2018-11-16T11:09:34Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. &amp;lt;br&amp;gt;-thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 65%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 35%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:oval1.jpg|400px]][[File:oval2.jpg|400px]]&lt;br /&gt;
| Oval Misinterpretation&amp;lt;br&amp;gt;Jeff &amp;amp; H37EA stellar system&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;1.Draw a square of 140x140mm, in counterclockwise direction, each side take the line from 10mm to 130mm.&amp;lt;br&amp;gt;2.Each 10mm distance set a dot, draw a line to connect the 10mm dot of square left line with the 10mm dot of the bottom line, repeat until the 130mm dots of both lines are connected. There will be 13 new lines.&amp;lt;br&amp;gt;3.Among the new lines, take the 4th line(with 40mm at both ends) and there are 12 cross points with the other new lines, use these 13 points to connect the 13 dots of the square right line, the toppest point connects with the toppest dot, till the most bottom point and dot are connected.&amp;lt;br&amp;gt;4.Like the 3rd step, take the 10th line, use the 13 points on it to connect the 13 dots of the square top line, the most left point connects with the most left dot, till the most right ones.&amp;lt;br&amp;gt;5.The graphic will be kind of a net, pick 17 crosspoints/dots inside the square randomly(whichever you like) and mark them with the chosen order numbers.&amp;lt;br&amp;gt;6.Draw a line to connect No.1 with No.7, mark the middle of the line, draw randomly a small ellipse on it and give a name to the ellipse.&amp;lt;br&amp;gt;Now find No.2/8/9, connect them with a handdraw oval which needs to contain the ellipse inside. Repeat withe rest groups of No.3/10/11, No.4/12/13, No.5/14/15, No.6/16/17. Give a name to this stellar system.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;-thx Tobias&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice &amp;amp; HGP 3 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:gridnoise.png|400px]]&lt;br /&gt;
| Practice with noise/cos/matrix. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File:gridnoise.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Gridnoise.pde&amp;diff=101076</id>
		<title>File:Gridnoise.pde</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Gridnoise.pde&amp;diff=101076"/>
		<updated>2018-11-16T11:07:08Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Gridnoise.png&amp;diff=101075</id>
		<title>File:Gridnoise.png</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Gridnoise.png&amp;diff=101075"/>
		<updated>2018-11-16T11:07:08Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Oval2.jpg&amp;diff=101074</id>
		<title>File:Oval2.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Oval2.jpg&amp;diff=101074"/>
		<updated>2018-11-16T10:30:26Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Oval1.jpg&amp;diff=101073</id>
		<title>File:Oval1.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Oval1.jpg&amp;diff=101073"/>
		<updated>2018-11-16T10:30:23Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100655</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100655"/>
		<updated>2018-11-09T01:25:53Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm. -thx Lorenz&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 2 —  9.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:wallpaper.png|400px]]  [[File:wildness.jpg|400px]]&lt;br /&gt;
| Practice with array. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[File: float_array_tryout.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wildness.jpg&amp;diff=100654</id>
		<title>File:Wildness.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wildness.jpg&amp;diff=100654"/>
		<updated>2018-11-09T01:25:05Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: Baiyao Lin uploaded a new version of File:Wildness.jpg&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wildness.jpg&amp;diff=100653</id>
		<title>File:Wildness.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wildness.jpg&amp;diff=100653"/>
		<updated>2018-11-09T01:22:00Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: Baiyao Lin uploaded a new version of File:Wildness.jpg&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wildness.jpg&amp;diff=100652</id>
		<title>File:Wildness.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wildness.jpg&amp;diff=100652"/>
		<updated>2018-11-09T01:17:13Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wallpaper.png&amp;diff=100651</id>
		<title>File:Wallpaper.png</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Wallpaper.png&amp;diff=100651"/>
		<updated>2018-11-09T01:17:09Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Float_array_tryout.pde&amp;diff=100650</id>
		<title>File:Float array tryout.pde</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Float_array_tryout.pde&amp;diff=100650"/>
		<updated>2018-11-09T01:17:05Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100243</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100243"/>
		<updated>2018-11-02T09:22:25Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice 1 — 26.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==2D Grid Structure — 2.11.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:arc.gif|400px]]&lt;br /&gt;
| 2D grid structure with rotate. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Arc.pde|Arc.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Arc.pde&amp;diff=100242</id>
		<title>File:Arc.pde</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Arc.pde&amp;diff=100242"/>
		<updated>2018-11-02T09:16:44Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Arc.gif&amp;diff=100241</id>
		<title>File:Arc.gif</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Arc.gif&amp;diff=100241"/>
		<updated>2018-11-02T09:16:43Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100240</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100240"/>
		<updated>2018-11-02T09:15:05Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm for Humans 1 &amp;amp; Algorithm of Manvel — 19.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manuel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manuel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100176</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100176"/>
		<updated>2018-10-31T20:00:48Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice 1 — 26.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manvel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manvel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algo1.jpg|400px]]&lt;br /&gt;
| 8 horizontal parallel equidistant fillet wavy lines, 30mm from the upper and lower boundaries of the paper, each height of 20mm. 8 equidistant vertical parallel zigzag lines, 30mm from the left and right boundaries, each height of 10mm. And these two kinds of lines would form many individual spaces, each space should contain one square in the center. The side length of the squares gradually increases from the center of paper to its boundaries, the innermost&#039;s length is 2mm and the outermost&#039;s is 6mm.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100020</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100020"/>
		<updated>2018-10-30T23:22:19Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice 1 — 26.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manvel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manvel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 70%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 30%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:algorithm1.jpg|400px]]  [[File:algo1.jpg|400px]]&lt;br /&gt;
| My first algorithm was hard to understand, so i changed a bit and excuted it anyway.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Algorithm1.jpg&amp;diff=100019</id>
		<title>File:Algorithm1.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Algorithm1.jpg&amp;diff=100019"/>
		<updated>2018-10-30T23:18:31Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Algo1.jpg&amp;diff=100018</id>
		<title>File:Algo1.jpg</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=File:Algo1.jpg&amp;diff=100018"/>
		<updated>2018-10-30T23:18:29Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100017</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=100017"/>
		<updated>2018-10-30T23:16:23Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm for Humans 1 &amp;amp; Algorithm from Manvel — 19.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm of Manvel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manvel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=99947</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=99947"/>
		<updated>2018-10-30T10:55:39Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm for Humans 1 — 19.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 &amp;amp; Algorithm from Manvel — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm from Manvel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
	<entry>
		<id>https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=99946</id>
		<title>GMU:Algorithmic Art/Baiyao Lin</title>
		<link rel="alternate" type="text/html" href="https://www.uni-weimar.de/kunst-und-gestaltung/wiki/index.php?title=GMU:Algorithmic_Art/Baiyao_Lin&amp;diff=99946"/>
		<updated>2018-10-30T10:48:53Z</updated>

		<summary type="html">&lt;p&gt;Baiyao Lin: /* Algorithm Practice 1 — 26.10.18 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm for Humans 1 — 19.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
|  [[File:first algorithm.jpg|600px|Introductory Algorithm]] &lt;br /&gt;
| 1. Superimposed results of the Introductory Algorithm. By executing the algorithm, each participant of the class created a unique personal sign, based on their own name.  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;  [[Media:introductory_algorithm.pdf|Introductory Algorithm]] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 2. Executed algorithm of Manvel, called &#039;&#039;&#039;Arccry&#039;&#039;&#039;, inspired by &#039;Farcry&#039; and the arcs presented.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Algorithm Practice 1 — 26.10.18==&lt;br /&gt;
&lt;br /&gt;
{| border=&amp;quot;1&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Result&lt;br /&gt;
! style=&amp;quot;width: 50%&amp;quot; | Algorithm&lt;br /&gt;
|-&lt;br /&gt;
| [[File:László Moholy-Nagy.png]] &lt;br /&gt;
| Work of László Moholy-Nagy. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; [[Media:Moholy-Nagy.pde|Moholy-Nagy.pde]]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Baiyao Lin</name></author>
	</entry>
</feed>