Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2290
Full metadata record
DC FieldValueLanguage
dc.contributor.authorQu, R-
dc.coverage.spatial26en
dc.date.accessioned2008-05-23T14:48:34Z-
dc.date.available2008-05-23T14:48:34Z-
dc.date.issued1992-
dc.identifier.citationMaths Technical Papers (Brunel University). May 1992, pp 1-22en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/2290-
dc.description.abstractIn this paper, an interpolatory subdivision algorithm for surfaces over ar-bitrary triangulations is introduced and its convergence properties over nonuni-form triangulations studied. The so called Butterfly Scheme (interpolatory) is a special case of this algorithm. In our analysis of the algorithm over uniform triangulations, a matrix approach is employed and the idea, of "Cross Differ-ence of Directional Divided Difference" analysis is presented. This method is a generalization of the technique used by Dyn, Gregory and Levin etc. to analyse univariate subdivision algorithms. While for nonuniform data, an extraordi-nary point analysis is introduced and the local subdivision matrix analysis is presented. It is proved that the algorithm produces smooth surfaces over ar-bitrary triangular networks provided the shape parameters are kept within an appropriate range.en
dc.format.extent489807 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherBrunel Universityen
dc.relation.ispartofBrunel University Mathematics Technical Papers collection;-
dc.relation.ispartofseriesTR/04/92-
dc.titleAn interpolatory subdivision algorithm for surfaces over arbitrary triangulationsen
dc.typeResearch Paperen
Appears in Collections:Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
TR_04_92.pdf478.33 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.