Home > Software engineering >  Circular segmentation problem
Circular segmentation problem

Time:11-25

Red is a sphere, boundary point has been found, closed curve is a green, if the green lines of code to find the weaknesses or concave points (I won't be here), the intersection of the circle form place to cut, to achieve, as shown in the picture blue line segmentation bad at math, the great god guide

CodePudding user response:

Don't need too complex algorithm, if you find the center of the circle, circle line must be perpendicular to the two attachment, according to two for the sphere
  • Related