Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    text
    copied!<p>I assume, that while polygonizing, you sampled points on the curve, and joined them with straight lines. The reverse process is curve fitting.</p> <p>You want to do a "Hermite fitting of curve through a set of points". A little search will help you out.</p> <p>There are more such fitting algorithms. This is maths based and the under the hood solution to what you want. This is also how most such problems are solved.</p> <p>If you want a quick solution, you would have to find a library that does it for you. i.e take a set of points, and fits a curve through them. </p> <p><strong>Note:</strong> I assume that fitting a curve through more than 4000 nodes is going to be costly. You could try it and see the performance for yourself, as I am not sure how costly would this be. But, I would suggest that if you needed to maintain the accuracy of your boolean operation. You should not have polygonized them at first. It is just redundancy of efforts to lose accuracy only to gain it back. Boolean set operations can be be done, and are done, without polygonizing the curve data.</p> <p><strong>Links</strong> for reference, and demos</p> <p><a href="http://en.wikipedia.org/wiki/Spline_interpolation" rel="nofollow">http://en.wikipedia.org/wiki/Spline_interpolation</a></p> <p><a href="http://www.math.ucla.edu/~baker/java/hoefer/Spline.htm" rel="nofollow">http://www.math.ucla.edu/~baker/java/hoefer/Spline.htm</a></p> <p><a href="http://www.math.ucla.edu/~baker/java/hoefer/Lagrange.htm" rel="nofollow">http://www.math.ucla.edu/~baker/java/hoefer/Lagrange.htm</a></p>
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload