Filling polygonal holes with bicubic patches (Q1334847): Difference between revisions

The authors study the problem of filling a polygonal hole in a surface given by \(C^ 1\) data on the boundary of the hole with a \(C^ 1\) surface patch. They give an explicit algorithm that works well for triangular holes but in general does not fit the boundary data and shows undesirable flutter for boundaries that are piecewise curvilinear \(n\)- gons, \(n>3\). They modify the algorithm with the introduction of more degrees of freedom following a method introduced by the second author in his Ph.D. thesis (1991) and show that flutter can be avoided if the boundary of the hole may be slightly disturbed.