Abstract
A method is presented which is capable of capturing surfaces of arbitrary topology. Derived from standard bicubic Bezier patches, it `fills in' n-sided regions with four-sided patches. It is based on a recursive patch-midpoint subdivision algorithm on a rectangular framework of control points, which is then generalized to arbitrary control-point nets. At each step, a new set of points with more vertices and smaller faces than the original set of points is constructed, resulting in a smooth surface. This structure provides the foundation for a general method to construct a smooth surface where the structure contains non-rectangular patches.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE Symposium on Information Visualization |
| Editors | E. Banissi, F. Khosrowshahi, M Sarfraz |
| Publisher | IEEE |
| Pages | 300-306 |
| Number of pages | 7 |
| Publication status | Published - 1998 |
| Event | Proceedings of the 1998 International Conference on Information Visualization, IV - London, UK Duration: 29 Jul 1998 → 31 Jul 1998 |
Other
| Other | Proceedings of the 1998 International Conference on Information Visualization, IV |
|---|---|
| City | London, UK |
| Period | 29/07/98 → 31/07/98 |