inner/outer edge division (2)

Problem

1. random division point is not robust, outer/inner distance is too variable

Solution

1. what's robust is the fact that, the division points on outer edge and inner edge are farther apart than consecutive points within outer/inner group

Implementation

1. sort the angular seg radially and take diff(vr),
   
2. find the max diff(vr) and divide.