Extending Pseudosegment Arrangements by Subdivision

Let $\mathcal{S}$ be a family of $n$ pseudosegments in the plane, with each pair intersecting at most once. Subdivide members of $\mathcal{S}$ at newly introduced vertices so that the resulting curves can be extended to a pseudoline arrangement. Determine the minimum worst-case number of added vertices as a function of $n$.