A Computational Complexity Adaptive Nurbs Curve Interpolation Method
A technology of computational complexity and curve interpolation, applied in computer control, instruments, simulators, etc., can solve the problems of algorithm performance fluctuation, low performance, and high average computational complexity, so as to reduce computational complexity and improve interpolation efficiency. Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0044] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments.
[0045] 1. Analyze the calculation structure of the de Boor-Cox method when calculating the interpolation point, and establish the computational complexity formula for solving the interpolation point. figure 1 , figure 2 It is the calculation structure of de Boor-Cox method for B-spline curve evaluation and derivation respectively. Let the function D(k,n,m) be the total number of multiplication and division operations required for curve interpolation when using the de Boor-Cox method, where k is the number of NURBS curves, n is the number of control vertices, and m is the operation The highest order of derivatives in the process, 0≤i≤n. Since the value of m is 1 or 2 in the actual calculation process, combined with the expression (1) of the NURBS curve, the expressions of D(k,n,m) when m=1 and m=2 can be obtained as formula (2 ), (3) shown....
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com