Abstract
Degree elevation is a typical corner-cutting algorithm. It refers to the process transforming control polygons when embedding a polynomial space of some degree into any polynomial space of higher degree. Dimension elevation similarly refers to the transformation of control polygons when embedding an Extended Chebyshev space possessing a Bernstein basis into another one, of higher dimension. Unlike degree elevation, this cannot always be split into successive (corner-cutting) steps elevating the dimension by one. What happens when it is not possible is investigated here. We shall see that the new control points can even be located outside the initial control polygons, giving evidence that dimension elevation is not always corner-cutting.
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 call
