Improving Sort Keys Part 2
Filter mode:
Topics
Media
(null topic)
🗪Chat Comment
🖮Programming🟉
🗩Speech
🎭
🏟
🔗
Link to: current timestamp
Credits
Host
Casey Muratori
Indexer
Matt Mascarenhas
?
?

Keyboard Navigation

Global Keys

[, < / ], > Jump to previous / next episode
W, K, P / S, J, N Jump to previous / next timestamp
t / T Toggle theatre / SUPERtheatre mode
V Revert filter to original state Y Select link (requires manual Ctrl-c)

Menu toggling

q Quotes r References f Filter y Link c Credits

In-Menu and Index Controls

a
w
s
d
h j k l
←
↑
↓
→

Esc Close menu / unfocus timestamp

Quotes and References Menus and Index

Enter Jump to timestamp

Quotes, References and Credits Menus

o Open URL (in new tab)

Filter Menu

x, Space Toggle category and focus next
X, ShiftSpace Toggle category and focus previous
v Invert topics / media as per focus

Filter and Link Menus

z Toggle filter / linking mode

Credits Menu

Enter Open URL (in new tab)
0:11Recap and set the stage for the day
0:11Recap and set the stage for the day
0:11Recap and set the stage for the day
1:51Blackboard: Tile Z Sorting
1:51Blackboard: Tile Z Sorting
1:51Blackboard: Tile Z Sorting
2:38Blackboard: How to sort when looking directly top-down
2:38Blackboard: How to sort when looking directly top-down
2:38Blackboard: How to sort when looking directly top-down
6:08Blackboard: The complication that arises from tilting the camera
6:08Blackboard: The complication that arises from tilting the camera
6:08Blackboard: The complication that arises from tilting the camera
8:29Blackboard: Quantising entities to tiles
8:29Blackboard: Quantising entities to tiles
8:29Blackboard: Quantising entities to tiles
10:14Blackboard: The problem with rugs
10:14Blackboard: The problem with rugs
10:14Blackboard: The problem with rugs
13:02Blackboard: Painter's Algorithm
13:02Blackboard: Painter's Algorithm
13:02Blackboard: Painter's Algorithm
14:35Blackboard: The cases of the rug situation
14:35Blackboard: The cases of the rug situation
14:35Blackboard: The cases of the rug situation
22:03Blackboard: Top-down 2D vs 3D
22:03Blackboard: Top-down 2D vs 3D
22:03Blackboard: Top-down 2D vs 3D
27:01Blackboard: Using planar maths
27:01Blackboard: Using planar maths
27:01Blackboard: Using planar maths
29:42Blackboard: Considering this as a 3-dimensional problem
29:42Blackboard: Considering this as a 3-dimensional problem
29:42Blackboard: Considering this as a 3-dimensional problem
36:02Blackboard: Flat vs Upright Entities
36:02Blackboard: Flat vs Upright Entities
36:02Blackboard: Flat vs Upright Entities
41:50Blackboard: The problem of Y inside a single cell
41:50Blackboard: The problem of Y inside a single cell
41:50Blackboard: The problem of Y inside a single cell
46:32Blackboard: The case with a tilted camera looking down on a hero standing on a rug
46:32Blackboard: The case with a tilted camera looking down on a hero standing on a rug
46:32Blackboard: The case with a tilted camera looking down on a hero standing on a rug
49:53Blackboard: Using the closest point entities have in common to determine the sorting
49:53Blackboard: Using the closest point entities have in common to determine the sorting
49:53Blackboard: Using the closest point entities have in common to determine the sorting
58:34Q&A
🗩
58:34Q&A
🗩
58:34Q&A
🗩
59:59sssmcgrath If you're only concerned about sprites that exist on more than one cell, why not split the polygons on cell boundaries? There can't be that many / can't be that expensive?
🗪
59:59sssmcgrath If you're only concerned about sprites that exist on more than one cell, why not split the polygons on cell boundaries? There can't be that many / can't be that expensive?
🗪
59:59sssmcgrath If you're only concerned about sprites that exist on more than one cell, why not split the polygons on cell boundaries? There can't be that many / can't be that expensive?
🗪
1:02:28Wind down
🗩
1:02:28Wind down
🗩
1:02:28Wind down
🗩