We showed that the expected running time of the incremental linear programming is O(n). However, we assumed that each vertex of Ci is determined by exactly two line Li, Lj. Show that if some vertices are shared by 3 or more lines, (that is, v Li Lj Lk) then the expected running time is actually faster