c# - Modifying a convex hull to exclude unwanted points -

In my C # -Sylllightlight 3 program, I have a set of digits, those points have a different color, green, red Or blue can be. Then I will make a convex hull for different points: one thin for green, thin for red and a hull for blue color. Now it can happen, that the color of the green in green in every color, with the other color, is the number.

Is there an algorithm to modify the hull, so that the other color points to be excluded from the hull (which will not converge at this point now)?

In advance thank you, Frank

translate into classic travel salesman issue.

Use the points that make it hull and connect other points you want to exclude them. Now find the circular route at this point and you have this new rudder

edit

We need to find a non-crossing path on the points.

Sort this point on the angle

Find a point in the middle (for example the Artificial Center)

Calculate angle (use ANA2 function)

Complexity now N * log (n)