Addressable LED build · single-data-line routing

Infinity Polyhedron Wiring Map

Edge strips
Jumper wires
Corners
Faces

Your LEDs live on the edges of the solid. Feeding one continuous WS2812-style data string through every edge is an Euler-path problem — fully possible only when at most two corners have an odd number of meeting edges. Pick a solid: the map numbers every edge-strip in signal order from a bottom corner, shows the direction, and adds the minimum bridge wires the math requires — sometimes zero. Drag to rotate · scroll/pinch to zoom · right-drag or two fingers to pan.

strip jumper DIN start DOUT end
StepSolder pathWhat it is
Build order = signal order. Solder DOUT→DIN at every corner. Jumper rows are bare bridge wires (data + V+/GND), no LEDs.

How to read it

Geometry: the five Platonic solids (golden-ratio / unit coordinates), each oriented face-down · Routes solved as minimum Eulerian paths (perfect-matching + Hierholzer).