[D] Intuition behind polyhedral-based IR in DL compilers

while reading [https://arxiv.org/abs/2002.03794](https://arxiv.org/abs/2002.03794), I came across a section about polyhedral-based IR; the way I understand it:
imagine, you have a 3D cube (let's call it A) that represents a tensor; let's say you have a nested loop that accesses a subcube (let's call it B) of A, where every ith access needs the result of (i -1)th access (B consists of cells and the loop is accessing those cells). the way polyhedral-based IR optimizes the said loop is it divides …

call cells every imagine loop machinelearning tensor the way