Closed chrismwendt closed 10 years ago
Most of this has been completed. What isn't done yet is the checking of edges and faces to determine the nearest point in a convex hull.
Completed in commit 9ae523012d920ffbdb793044ffb51df8c4f1561d.
See the improvement (notice the nearest vertex solution looks too harsh):
Spawn a thread to do processing when the user hits enter. The processing will update the displayed image, while leaving the original.
Steps:
Alpha values are set to b/(a+b) where a and b are the distances to the nearest points in or on the foreground and background convex hulls, respectively. Colors are set to the color of the nearest point inside the foreground convex hull.