Survey and new results in n-sided patch generation
Proceedings on Mathematics of surfaces II
A multisided generalization of Bézier surfaces
ACM Transactions on Graphics (TOG)
Overlap patches: a new scheme for interpolating curve networks with n-sided regions
Computer Aided Geometric Design
Computer Aided Geometric Design
Filleting and rounding using trimmed tensor product surfaces
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Control point surfaces over non-four-sided areas
Computer Aided Geometric Design
Non-uniform recursive subdivision surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Modelling surfaces from planar irregular meshes
Computer Aided Geometric Design
Modelings surfaces from meshes of arbitrary topology
Computer Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
A generic approach to free form surface generation
Proceedings of the seventh ACM symposium on Solid modeling and applications
Letters to the editor: Non-four-sided patch expressions with control points
Computer Aided Geometric Design
| Hi-index | 0.00 |
We present a method for constructing an n-sided patch of parametric surface, with n greater than 2. The main property of the resulting patch is that its boundary coincides with a B-spline. Thus, it can easily be connected to given B-spline surfaces with fixed continuity conditions. The patch is built from a star-shaped input mesh that outlines a generic n-hole and a surface in a vicinity of the hole. The main advantages of the method are the following: continuity conditions of arbitrary order k can be imposed; the mesh involved can have an arbitrary number of sides and an arbitrary shape (convex or not); the simplicity of the construction process makes it an easy and flexible method; and finally, the surface near the boundary is a B-spline with piecewise uniform knot sequences and whose control points are vertices of the mesh (both knot sequences and control points are easily computed). We give implementation details for evaluating a surface point and show that the de Boor algorithm can be exploited for efficiency.