Abstract
This study gives the new definition of the rational L curve and surface in Grassmann space, where convert these rational recursive curves and surfaces’ equations to normal polynomial. So we can use blossom algorithms and duality principle to deduce the derivative equations of these curves and surfaces. Thus, the rational L spline curve and surface are defined and constructed based on blossom algorithms and ensuring the continuity of L curve segment and surface patch. Next, we prove that rational L spline curve and surface are the generalization of many interpolation or approach parameter curves and surfaces (Lagrange, rational Lagrange, Bezier, rational Bezier, B spline, NURBS curves and surfaces, etc.). These recurrence curves and surfaces are used to establish the universal storage data file format for different CAD systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Luo, X.: Curves and Surfaces in Computer Aided Geometric Design. PHD dissertation. Dalian University of Technology (1992)
Luo, X., Nie, H., Li, Y., Luo, Z.: Recurrence Surfaces on Arbitrary Quadrilateral Mesh. Journal of Computational and Applied Mathematics 144, 221–232 (2002)
Ramshaw, L.: Blossoming: a Connect-the-Dots Approach to Splines. Systems Research Center (1987)
Goldman, R.: Blossoming with Cancellation. Computer Aided Geometric Design 16, 671–689 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, X., Lin, S. (2006). Recursive Curves and Surfaces in Grassmann Space for Computer Modeling and Animation. In: Pan, Z., Aylett, R., Diener, H., Jin, X., Göbel, S., Li, L. (eds) Technologies for E-Learning and Digital Entertainment. Edutainment 2006. Lecture Notes in Computer Science, vol 3942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11736639_135
Download citation
DOI: https://doi.org/10.1007/11736639_135
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33423-1
Online ISBN: 978-3-540-33424-8
eBook Packages: Computer ScienceComputer Science (R0)