|
UWSpace >
University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10012/3681
|
| Title: | Triangular Bézier Surfaces with Approximate Continuity |
| Authors: | Liu, Yingbin |
| Keywords: | Triangular Bezier patches
surface continuity |
| Approved Date: | 15-May-2008 |
| Date Submitted: | 2008 |
| Abstract: | When interpolating a data mesh using triangular Bézier patches, the requirement of C¹ or G¹ continuity imposes strict constraints on the control points of adjacent patches. However, fulfillment of these continuity constraints cannot guarantee that the resulting surfaces have good shape. This thesis presents an approach to constructing surfaces with approximate C¹/G¹ continuity, where a small amount of discontinuity is allowed between surface normals of adjacent patches.
For all the schemes presented in this thesis, although the resulting surface has C¹/G¹ continuity at the data vertices, I only require approximate C¹/G¹ continuity along data triangle boundaries so as to lower the patch degree.
For functional data, a cubic interpolating scheme with approximate C¹ continuity is presented. In this scheme, one cubic patch will be constructed for each data triangle and upper bounds are provided for the normal discontinuity across patch boundaries.
For a triangular mesh of arbitrary topology, two interpolating parametric schemes are devised. For each data triangle, the first scheme performs a domain split and constructs three cubic micro-patches; the second scheme constructs one quintic patch for each data triangle. To reduce the normal discontinuity, neighboring patches across data triangle boundaries are adjusted to have identical normals at the middle point of the common boundary. The upper bounds for the normal discontinuity between two parametric patches are also derived for the resulting approximate G¹ surface.
In most cases, the resulting surfaces with approximate continuity have the same level of visual smoothness and in some cases better shape quality. |
| Program: | Computer Science |
| Department: | School of Computer Science |
| Degree: | Doctor of Philosophy |
| URI: | http://hdl.handle.net/10012/3681 |
| Appears in Collections: | Electronic Theses and Dissertations (UW)
Faculty of Mathematics Theses and Dissertations
|
This item is protected by original copyright
|
All items in UWSpace are protected by copyright, with all rights reserved.
|
