Abstract
The obvious thing to want to do, given a scheme, is to be able to draw its polygons at successive levels of refinement. Although this is an obvious requirement, it is far from the whole story, and subsequent chapters in this part will address the real requirements. However, as a preliminary to that, we shall consider some different ways of programming the refinement steps themselves, making polygons, given the scheme and the initial polygon. The first three of these are each obvious, but they differ, depending on the way that you really look at the refinement equation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sabin, M. (2010). Making Polygons. In: Analysis and Design of Univariate Subdivision Schemes. Geometry and Computing, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13648-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-13648-1_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13647-4
Online ISBN: 978-3-642-13648-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)