Volume 4 Number 5 (Oct. 2012)
Home > Archive > 2012 > Volume 4 Number 5 (Oct. 2012) >
IJCEE 2012 Vol.4(5): 693-696 ISSN: 1793-8163
DOI: 10.7763/IJCEE.2012.V4.586

Optimal Multi-Degree Reduction of Bézier Curves with Constraints, Using Matrix Computations

Davood Bakhshesh and Mohammad Reza Samiee

Abstract—In this paper, we consider multi-degree reduction of Bézier curves with constraints of endpoints continuity with constraints of endpoints continuity with respect to L_2 norm, using matrix computations. We find an explicit form of the multi-degree reduction matrix for Bézier curve with constraints of endpoints continuity.

Index Terms—Bézier curves, Degree reduction, Degree elevation, Endpoints continuity.

Davood Bakhshesh is with the Department of Computer Science, University of Bojnord, Bojnord, Iran (e-mail: dbakhshesh@gmail.com).
Mohammad Reza Samiee is with Department of Computer Engineering, Payame Noor University (PNU), Khorasan Shomali, Iran (e-mail:samiee.reza@gmail.com).

Cite: Davood Bakhshesh and Mohammad Reza Samiee, "Optimal Multi-Degree Reduction of Bézier Curves with Constraints, Using Matrix Computations," International Journal of Computer and Electrical Engineering vol. 4, no. 5, pp. 693-696, 2012.

General Information

ISSN: 1793-8163 (Print)
Abbreviated Title: Int. J. Comput. Electr. Eng.
Frequency: Quarterly
Editor-in-Chief: Prof. Yucong Duan
Abstracting/ Indexing: EI (INSPEC, IET), Ulrich's Periodicals Directory, Google Scholar, EBSCO, ProQuest, and Electronic Journals Library
E-mail: ijcee@iap.org

What's New

  • Jun 03, 2019 News!

    IJCEE Vol. 9, No. 2 - Vol. 10, No. 2 have been indexed by EI (Inspec) Inspec, created by the Institution of Engineering and Tech.!   [Click]

  • Oct 11, 2019 News!

    IJCEE Vol 11, No 4 is available online now   [Click]

  • Oct 11, 2019 News!

    The dois of published papers in Vol 11, No 1- Vol 11, No 3 have been validated by Crossref

  • Aug 20, 2019 News!

    IJCEE Vol 11, No 3 is available online now   [Click]

  • Jun 03, 2019 News!

    IJCEE Vol. 11, No. 2 is available online now.   [Click]

  • Read more>>