Algorithm 1 Corrugated infill pattern algorithm.
1: Initialize the preferred type of infill pattern and calculate the position of anchor points (seeds)
2: $l,i,c,o\leftarrow 0$	▹ layer, interfaces, contact, old seeds
3: if infill type is corrugated then
4:   infill, seeds ←corrugated infill($l,i,c,o$))
5: end if
6: function corrugated infill($l,i,c,o$)
7:   $s\leftarrow$find closest points($l,o$)	▹ seeds
8:   $p\leftarrow [0,0,0]$	▹ points
9:   while $n<i$ do
10:     $r\leftarrow n$/i	▹ ratio
11:     if c is even then	▹ inside contour
12:       $b\leftarrow$P on contour($l.in,s.in,r-c$/2)
13:       $e\leftarrow$P on contour($l.in,s.in,r+c$/2)
14:       $t\leftarrow$points between($b,e$)
15:     else	▹ outside contour
16:       $b\leftarrow$P on contour($l.out,s.out,r-c$/2)
17:       $e\leftarrow$P on contour($l.out,s.out,r+c$/2)
18:       $t\leftarrow$points between($b,e$)
19:     end if
20:     $n\leftarrow n+1$
21:     $p\leftarrow p+[b,e,t]$
22:   end while
23:   $f\leftarrow$create line segments(p)
24: return   f
25: end function
26: function P on contour(k,s,r)
27:   $k\leftarrow$reorder($k,s$)
28:   $g\leftarrow$circumference(k)+r
29:   $m,d\leftarrow 0$	▹ segment, distance
30:   while $h<g$ do
31:     $h\leftarrow$distance($k\left[m\right],k[m+1]$)	▹ length
32:     $d\leftarrow d+h$
33:     $m\leftarrow m+1$
34:   end while
35:   $w\leftarrow g$–d
36:   $u\leftarrow w$/h
37:   $p\leftarrow$Interpolate($k\left[m\right],k[m$–$1],u$)
38: return  p
39: end function