Recently Updated Pages
Array Cheatsheet
Arrays Arrays hold values of the same type at contiguous memory locations. In an array, we're us...
System Design Overview
Yes, product design in system design interviews is a great place to start for...
normals
raycast
Quaternions
Dot Product
Cross Product
Sign Distance Fields
Quadtrees
Bounding Volume Hierarchy
Summary
Most Important Sorting Knowledge As a Technical Artist, focus on: Why Sorting Matters: G...
Bucket Sort
4. Bucket Sort Why Important: Bucket Sort works well when the data is uniformly distributed an...
Radix Sort
3. Radix Sort Why Important: Radix Sort is a non-comparative sorting algorithm and is faster t...
Merge Sort
2. MergeSort Why Important: MergeSort is stable (preserves the relative order of equal element...
QuickSort
1. QuickSort Why Important: QuickSort is one of the fastest general-purpose sorting algorithms...
Octrees
Strict Tree
skeletal rigs use this
Hash Set
Example regular set: # Regular Set (Without Hashing) my_set = {3, 7, 1, 9, 5} # Searching ...
Basics Cheatsheet
Built-in # primitives x = 1 # integer x = 1.2 # float x = True ...
Variables in Memory
The computer has finite resources for "remembering" things. So, you can't just keep asking it to ...