A Voronoi diagram allows to divide a 2D space made up of a set of points (the seeds) into regions or cells. A cell includes all 2D points {x;y} that are closer to a particular seed than any other. You can find more information here: Voronoi diagram.
The demogroup fsqrt has published a Voronoi animation in 64 bytes only. The 64-byte demo is coded in pure assembler for the MS-DOS platform using the old good
You can download the demo here: voron.
Here is the complete source code:
;voron ;64 byte MS-DOS intro ; ;by fsqrt ;http://fsqrt.blogspot.com/ ;pzagrebin@gmail.com ;25-09-2013 ;Dynamic Voronoi diagram, ;esc exit and coder colors are included! org 0x100 xchg ax, cx mov al, 0x13 int 0x10 les bp, [bx] mov bh, 4 LA: adc bl, cl adc [bx], bh loop LA mov cl, 99 L0: mov bl, 0xFC mov [si+1], bl L: mov ax, 0xCCCD mul di mov al, dh sub al, [bx] imul al xchg ax, dx sub al, [bx+1] imul al add ax, dx cmp ax, [si] ja p1 mov [si], ax mov [es:di], bl p1: sub bl, bh jnz L inc di jnz L0 in al, 0x60 dec al jnz LA ret