Abstract
We present an efficient algorithm, which solves an isoperimetric type problem in the class of Bézier curves of degree n > 2 . This algorithm requires to compute the maximal characteristic value and the corresponding principal vector of a regular pencil problem with block square matrices of dimension 2 n − 2 . The coordinates of the principal vector determine the control points of the extremal curve, while the characteristic value gives the maximal area bounded by this curve.
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.
