Abstract
The approximate merging of two adjacent B-spline surfaces into a B-spline surface is the core problem in data communication. A novel algorithm is presented in this paper to solve this problem. In this algorithm, we compute the merging error using L2 norm instead of the Euclidean norm, the process of merging is minimizing the approximate error and we only need solve a system of linear equations to get the final merging surface. In order to reduce the merging error, we add a weighed function on objective function to start the next merger; this function adds greater weight on where error is larger. After the next merger, the merging error will be significantly reduced. Finally, some examples are given to demonstrate the effectiveness and validity of the proposed algorithm.
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.
