We show that every planar straight line graph PSLG with n vertices can be augmented to a 2-edge-connected PSLG with the addition of at most $$\lfloor 4n-4/3\rfloor $$ new edges. This bound is the best possible.
['Hugo Alves Akitaya', 'Jonathan Castello', 'Yauheniya Lahoda', 'Anika Rounds', 'Csaba D. Tóth']
Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity