122 search results - page 12 / 25 » cagd 2008 |
CAGD
2005
13 years 8 months ago
2005
If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are ...
CAGD
2005
13 years 8 months ago
2005
Abstract: Barycentric coordinates can be used both to express a point inside a tetrahedron as a convex combination of the four vertices and to linearly interpolate data given at th...
CAGD
2005
13 years 8 months ago
2005
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
CAGD
2005
13 years 8 months ago
2005
We consider the interpolation of a given set of ordered space data points by a smooth curve in the presence ofa set offinite or infinite constraint planes, where the polyline join...
CAGD
2005
13 years 8 months ago
2005
The paper iterates on the observation made independently by several groups of authors that building subdivision schemes out of simple, very local and geometrically invariant avera...