Abstract
In this paper we propose a tensor based description of the Bézier Shape Deformation (BSD) algorithm, denoted as T-BSD. The BSD algorithm is a well-known technique, based on the deformation of a Bézier curve through a field of vectors. A critical point in the use of real-time applications is the cost in computational time. Recently, the use of tensors in numerical methods has been increasing because they drastically reduce computational costs. Our formulation based in tensors T-BSD provides an efficient reformulation of the BSD algorithm. More precisely, the evolution of the execution time with respect to the number of curves of the BSD algorithm is an exponentially increasing curve. As the numerical experiments show, the T-BSD algorithm transforms this evolution into a linear one. This fact allows to compute the deformation of a Bézier with a much lower computational cost.
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.
