The previous post introduces the basics of shadow mapping. However, I didn’t mention one of the fundamental problems: aliasing. If we take a closer look at the shadow, we will find it jagged on the edge.

# Parallel Scan for Exclusive Prefix Sum

Prefix Sum problem is to compute the sum of all the previous elements in an array. Specifically, exclusive prefix sum would compute all the strictly previous (self-exclusive) elements. For example,

# Binary Indexed Tree

• Able to
• Answer sum query within interval.
• Update within fixed-size array.
• Variant
• Answer prefix query of min/max.
• Code
Having learnt an object file has .text section for code, .data section for data, .bss section for uninitialized data, and so on and so forth, it’s still unclear how it’s mapped into a real ELF file. How an elf file can represent these informations? Through objdump, we may peek into the content of these sections.