Some background to this problem: Some baths can be remade into showers by pulling on two glass panels. Since my glass panels have high friction with the floor, I would like to sweep as small area as possible while extending them whenever I want to take a shower. I think it can be used also while trying to asses minimal space required for robotic arm to extend properly.
More formally if we look at the situation from above we have two segments of length $1$. First one is connected to the origin and the second one is connected to the second endpoint of the first one. At the start they are folded such that first segment goes from $[0,0]$ to $[0,1]$ and the second one goes from $[0,1]$ to $[0,0]$. Then after extending first segment should go from $[0,0]$ to $[1,0]$ and second segment from $[1,0]$ to $[2,0]$. Extension is any continuous movement of the two segments.
Swept area is total area which have the two segments covered and we count each crossed point exactly once, so in my example if we had kept point $D$ on $x$ axis and just pulled it to $[2,0]$ the total swept area would be the black region.
Now comes the question: What is the minimal area one can sweep while extending the segments?
Also how big is swept area from my example? Rules for my example are that point $D$ (endpoint of second segment) always stays on the $x$ axis and we just pull it along creating many equilateral triangles in the process. There is also a more general version, where we have $1000$ segments where ones with odd number go from $[0,0]$ to $[0,1]$ and ones with even number go the other way around. Notice that my example works also for arbitrary number of segments, since we can just unravel the segments in pairs and pushing those already unraveled along the $x$ axis, giving the same area overall.