projections as binary tree

jaynuine commented

2026-02-17 03:18:25 +00:00

Owner

store and traverse projections in and as a binary tree

we would only need to store the current top element whilst traversing, drawing lines to each sub, before recursively applying the function we're in to each sub, which would consist of a single map call by storing subs in an t_array or equivalent

store and traverse projections in and as a binary tree we would only need to store the current top element whilst traversing, drawing lines to each sub, before recursively applying the function we're in to each sub, which would consist of a single map call by storing subs in an t_array or equivalent

jaynuine added this to the todo project

2026-02-17 03:18:25 +00:00

jaynuine commented

2026-02-27 02:11:17 +00:00

Author

Owner

this would be specifically in the case of an open rectangular grid mesh such as that serialised in fdf maps but i could see this adapted to any mesh actually

jaynuine added this to the >9000 milestone

2026-02-27 02:11:20 +00:00

jaynuine commented

2026-02-27 02:12:28 +00:00

Author

Owner

this could be a great opportunity to implement and test out that one poc of storing the entire binary tree on the stack through recursive compound literals

jaynuine commented

2026-02-27 04:18:19 +00:00

Author

Owner

we dont actually need to store xz coordinates for such a mesh which could be implemented as a heightmap uniquely mapping (x,z) -> y

Rows
Columns

projections as binary tree #2