Abstract
A new intersection algorithm is developed for C2 parametric surface which is a combination of the subdivision and Newton's method. The subdivision method is used to “hunt” the first point for each intersection curve, starting from the second one, Newton's method is employed. A dedicated algorithm is developed to predict the initial values needed by Newton's method, a new concept “engaging direction” is also introduced to enhance the converging speed. As a result, the iteration times are remarkably reduced and all points on a particular intersection curve are automatically distributed in not only the correct order but also an optimal manner. The whole strategy has been successfully tested in a FORTRAN program where the uniform bi-cubic B-spline surface is used.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
