Edge Expansion - akilmarshall/procedural-image-generation GitHub Wiki

Considering a fragment member how can it's edge's be expanded? Or how can a set of compatible edges be computed given a fragment member?

   \mathcal{F}=
   \begin{bmatrix}
   & & & &\\ & a & b & c & \\ & d & e & f & \\ & h & i & j & \\ & & & &
   \end{bmatrix}

Considering a fragment member is $D_4$ (symmetry group of the square) any algorithm written to expand a specific edge can be transformed into an equivalent algorithm for another edge. There for all expansion algorithms described will be described for a single edge only.

I propose 3 algorithms, 2 of which are mirrored for computing the edge expansion of

\begin{bmatrix}
t_0 \\ t_1 \\ t_2
\end{bmatrix}

$CENTERX$ and $CORNERX$ (and it's mirror).