Crossed Cubes

Sobel Edge Detection

Nearest-neighbor stencil communication on CQ6

Photo28XDiamond Click Render Edges to animate the stencil exchange on `CQ6`.
Edge Detection via Nearest Neighbor CommunicationClick buttons above to visualize communication patterns.Each node processes a square block, then communicates with neighborsto seamlessly join the edges of blocks.Original ImageDigitized ImageProcessor Placement on CQ6Row neighbors use direct links; column neighbors communicate via a common neighbor.r0r4c0c4Sample vertical-neighbor routes(1,1) to (2,1) : 001001 -> 001011 -> 011001 [length 2](3,5) to (4,5) : 010111 -> 011101 -> 110111 [length 2](5,2) to (6,2) : 111011 -> 111001 -> 101011 [length 2]
This version uses a grayscale processing pipeline rather than a single binary jump, so we can watch local averaging soften the image before the Sobel edges appear. The important claim is algorithmic: a crossed cube does not need to contain a literal square-grid subgraph in order to support a grid-style stencil computation. Horizontal neighbors already lie on direct row links, while vertical neighbors can be routed over shortest crossed-cube paths of length at most two.