GEOMETRIC CONSTRUCTION FOR SETBACK VERTEX BLENDING

Citation
T. Varady et A. Rockwood, GEOMETRIC CONSTRUCTION FOR SETBACK VERTEX BLENDING, Computer Aided Design, 29(6), 1997, pp. 413-425
Citations number
22
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Software Graphycs Programming
Journal title
ISSN journal
00104485
Volume
29
Issue
6
Year of publication
1997
Pages
413 - 425
Database
ISI
SICI code
0010-4485(1997)29:6<413:GCFSVB>2.0.ZU;2-B
Abstract
Setback vertex blends merge edge blends by broadening them at certain distances from the vertex. In this way an overall smooth transition is provided. The necessity of this type of vertex blend is illustrated b y examples. We suggest a scheme where vertex blends are represented by 2n-sided patches, though special cases may also arise with an odd num ber of sides. Standard polynomial patches are combined according to th e so-called setback split, which provides a natural structure to defin e vertex blends and offers free parameters to adjust the interior shap e. The steps to create setback vertex blends and the basic mathematica l constraints to be satisfied are illustrated by the control frame con struction, which follows a repeated chamfering strategy. The control f rame approximates the vertex blend and indirectly determines most of t he surface qualities. A few special vertex blends are analysed in the last part of the paper. (C) 1997 Elsevier Science Ltd.