Connectivity augmentation in plane straight line graphs 1

It is shown that every plane straight line tree with n vertices can be augmented to a 2-edge connected plane straight line graph by adding at most ⌊n/2⌋ edges, and every connected plane straight line graph with n vertices can be augmented to a 2-edge connected plane straight line graph by adding at most edges.