commit 989f411f33ba83922045890d8d71b763e0094d8c
parent 83109526c190873a4194ee10d6d0c20d7a6a4f0c
Author: Andrew <andrewlaack1@gmail.com>
Date: Fri, 12 Apr 2024 09:13:19 -0500
Working through w11 lecture 2
Diffstat:
24 files changed, 102 insertions(+), 7 deletions(-)
diff --git a/Baking.md b/Baking.md
@@ -0,0 +1,17 @@
+:unity: :cs331:
+# Baking
+
+CS331 W11 Lecture 2
+
+## Notes
+
+**Definition:** The process of precomputing. Another term for this is statically computed (not dynamically computed ie realtime).
+
+There are two different types of precomputing we can implement:
+
+1. Lossless
+
+2. Lossy
+
+With lossless precomputing the quality is equal but performance is better while with lossy precomputing we have better performance at the cost of worse quality. An example of improved performance without loss in quality is precomputing bounding planes instead of calculating them based on points each time collision detection is called. An example of lossy precomputing would be to bake in shadows so they don't need to be recomputed, but this could cause issues with angles and changes over time in light.
+
diff --git a/CS202.md b/CS202.md
@@ -1,8 +1,10 @@
+:cs202: :c++: :index:
# CS 202
-This is the index for my cs 202 notes.
+This is the index for my cs 202 notes.
## Main Links
[[LinkedLists.md]]
[[MemoryManagement.md]]
+
diff --git a/CS331.md b/CS331.md
@@ -1,6 +1,7 @@
+:index: :cs331:
# CS 331
-This is the index for my CS 331 notes.
+This is the index for my CS 332 notes.
# Main Links
diff --git a/CounterExample.md b/CounterExample.md
@@ -1,3 +1,4 @@
+:proof: :math310:
# Proof By Counter Example
Abstract Math Proof Technique
diff --git a/DirectProof.md b/DirectProof.md
@@ -1,3 +1,4 @@
+:proof: :math310:
# Direct Proof
Abstract Math Proof Technique
diff --git a/DoublyLinkedList.md b/DoublyLinkedList.md
@@ -1,6 +1,7 @@
+:linked-lists: :c++: :cs202: :data-structures:
# Doubly Linked List
-CS 221 W 11 Lecture 13
+CS 221 W 11 Lecture 13.
## Notes
diff --git a/FibonacciNumbers.md b/FibonacciNumbers.md
@@ -1,3 +1,4 @@
+:math310:
# Fibonacci Numbers
Abstract Math 10.5.
diff --git a/FundamentalTheoremOfArithmetic.md b/FundamentalTheoremOfArithmetic.md
@@ -1,3 +1,4 @@
+:math310:
# The Fundamental Theorem of Arithmetic
Abstract Math 10.4. Can be proven through [[StrongInduction.md]]
diff --git a/Graphs.md b/Graphs.md
@@ -1,3 +1,4 @@
+:data-structures: :math310:
# Graphs
Abstract Math 10.2.
diff --git a/Induction.md b/Induction.md
@@ -1,3 +1,4 @@
+:math310: :proofs:
# Induction Proof
Proof by induction from W11 abstract algebra. Induction is used to prove a statement relating to infinite sets of elements. This is not to be confused with inductive reasoning which is assumptions based on past data.
diff --git a/LinkedLists.md b/LinkedLists.md
@@ -1,6 +1,7 @@
+:c++: :cs202: :data-structures:
# Linked Lists
-This is from CS 221 W11 Lecture 13
+This is from CS 221 W11 Lecture 13.
## Notes
diff --git a/Math310.md b/Math310.md
@@ -1,3 +1,4 @@
+:index: :math310:
# Math 310
This is the index for my main Math 310 notes.
diff --git a/MemoryManagement.md b/MemoryManagement.md
@@ -1,3 +1,4 @@
+:c++: :cs202:
# Memory Management
Memory management CS 202 ~W10 C++
diff --git a/MeshFilter.md b/MeshFilter.md
@@ -1,3 +1,4 @@
+:unity: :cs331: :unity-components:
# Mesh Filter
[[Unity]] game engine component
diff --git a/MeshRenderer.md b/MeshRenderer.md
@@ -1,6 +1,7 @@
+:unity: :unity-components: :cs331:
# Mesh Renderer
-[[Unity]] Component
+[[Unity]] Component.
## Notes
diff --git a/SinglyLinkedList.md b/SinglyLinkedList.md
@@ -1,6 +1,7 @@
+:linked-lists: :cs202: :c++: :data-structures:
# Singly Linked Lists
-CS 221 W11 Lecture 13
+CS 221 W11 Lecture 13.
## Notes
diff --git a/Skin.md b/Skin.md
@@ -0,0 +1,16 @@
+:unity: :cs331:
+# Skin
+
+CS 331 W11 Lecture 2
+
+## Notes
+
+**Definition:** The skin of an object is it's surface and how it looks.
+
+This is implemented in unity via the [[MeshRenderer.md]]
+
+Game engines implement [[Baking.md]] to hardcode this texture at the cost of accuracy when changing perspective and lighting.
+
+See [[TextureMaps.md]] for more information about object skin rendering.
+
+
diff --git a/SmallestCounterExample.md b/SmallestCounterExample.md
@@ -1,3 +1,4 @@
+:math310: :proofs:
# Smallest Counterexample
Abstract Math 10.3. This is similar to [[Induction.md]] and [[StrongInduction.md]]
diff --git a/StrongInduction.md b/StrongInduction.md
@@ -1,3 +1,4 @@
+:proofs: :math310:
# Strong Induction
Abstract Math 10.2. Weak induction is the normal form of induction discussed in [[Induction.md]]
diff --git a/TexRef.md b/TexRef.md
@@ -0,0 +1,20 @@
+:reference:
+# Tex references:
+
+List of TeX characters syntax I have had to look up.
+
+## Syntax
+
+\wedge - $\wedge$ and symbol/similar to carat
+
+\vee - $\vee$ or symbol/similar to upside down carat
+
+\mathbb{Q} - $\mathbb{Q}$ this is the set of real numbers (Q).
+
+\mathbb{I} - $\mathbb{I}$ this is the set of irrational numbers (I).
+
+\blacksquare - $\blacksquare$ this is the character used to denote the end of a proof.
+
+\nmid - $\nmid$ this is the character to describe not divisible by. Weird syntax I know.
+
+\not\equiv - $\not\equiv$ - This is the character describing not equivalent with the three lines horizontally.
diff --git a/TextureMaps.md b/TextureMaps.md
@@ -0,0 +1,10 @@
+:cs331: :unity:
+# Texture Maps
+
+Abstract Math W11 / 2
+
+## Notes:
+
+**Definition:** Texture maps are used to control the look of the [[Skin.md]] associated with an object. Texture maps attempt to simulate real world 3d surfaces without the cost of computing many meshes.
+
+
diff --git a/Unity.md b/Unity.md
@@ -1,3 +1,4 @@
+:index: :unity: :cs331: :game-development:
# Unity
Unity is a popular game engine, no duh.
@@ -11,6 +12,14 @@ Unity is a popular game engine, no duh.
**Aggregation:** Unity uses aggregation by grouping assets together (nesting)
+
+### Important Concepts
+
+[[Skin.md]]
+[[TextureMaps.md]]
+[[Baking.md]]
+
+
### Components
[[MeshFilter.md]]
diff --git a/WellOrdered.md b/WellOrdered.md
@@ -1,3 +1,4 @@
+:math310: :proof: :sets:
# Well Ordered
Abstract Math Chapter 10
diff --git a/index.md b/index.md
@@ -1,13 +1,17 @@
+:index:
# Index
-This is the index for my main note classifications. I will maintain this as a home page.
+This is the index for my main note classifications. I will maintain this as a home page.
## School
[[CS202.md]]
[[CS331.md]]
[[Math310.md]]
+[[TexRef.md]]
## Other
N/A
+
+
