Algorithms, data structures and applications for C^s-smooth RMB-splines of degree 2s+1
Please login to view abstract download link
The simple mesh refinement algorithm [1] generates T-meshes admitting Reachable Minimally supported (RM) B-splines that possess the property of local linear independence and form a non-negative partition of unity. The construction was first presented for the bilinear case and has later been extended to C^s-smooth splines of degree p = 2s + 1 [2]. The present talk is devoted to algorithms, data structures and applications for RMB-splines. More specifically, we will discuss about the constructions of RMB-splines, the data structures for representing a T-mesh and the associated RMB-splines, and the local adaptive spline projection using bicubic RMB-splines.