Won Chun

...because you only have to clip primitives that have both pixels in the viewport AND extend beyond the margin (the guard band). This should be very rare, and in your case you can just assume that it never happens.

The idea of guard bands for rasterization: clipping in pixel space is easy (simply don't visit pixels outside viewport) but your rasterizer has limited range, so you sometimes need to process the geometry. However, if your range has some margin, then you rarely have to do this...

Negabinary! Looks kind of related to ZigZag encoding with some interesting alternation of bits. Also, does this mean there are nega p-adics?https://twitter.com/pinkhairedcyn/status/1359893161859047424 …

Wow, this thread is super cool! h/t @pervognsenhttps://twitter.com/keenanisalive/status/1258152669727899650 …

*mem hah

Anyway, I was thinking recently that there is very little language support for heterogeneously structured things packed together. Like VLAs and that's it? Risky things with virtuals and placement new?

Speaking of compacting men, I question the idea that you'll run out of mem bandwidth with a only about one core accessing memory. I mean I guess that could have just been a proxy for cache hotness/utilization, but not bandwidth

Like you could cache and gather the results of your 2 pass decoder to save on indirections/compact working memory, avoid linked structures, etc.

There could be generic traversal apis as well as more cooked, contextual ones (else after then). There can be different representations, either as you experiment, or even maybe different trees get written out differently based on access pattern

Also it seems like you could alleviate a lot of worry about your tree rep by using accessor inlines/macros to do the tree nav. If you have tags or pointers that are elidable in mem, that can all be hidden by the accessors and give you flexibility.

I didn't get through the whole video, but DWARF's on disk representation is similar to your tree layout, although (usually) uses varint section-relative offsets. Also have "sibling" offsets to skip past subtrees.

Who else is going to #SIGGRAPH2019 ?

cc @dustmop

This NeurIPS talk by @drmichaellevin is blowing my mind! I don't think I can summarize this in a tweet except that biology has come a long way. https://www.youtube.com/watch?v=RjD1aLm4Thg …

I'd tell you a TCP joke bu

64 entries are for 4K pages, which is 256K. If you use 2M pages, you get 8 entries, or 16M. With 1G pages you get 4 entries or 4G. So the lesson is: use bigger pages if you can!