.png){kind=icon}
.png){kind=icon}
Return
Parallel B-spline surface fitting on mesh-connected computers
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1996.0082.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The solution of uniform bicubic B-spline curve/surface fitting problem is considered, Based on the matrix perturbation method, this paper first presents a novel approximate O(n/p)-time. parallel B-spline curve fitting algorithm for finding the corresponding n control points that interpolate those n data points on a linear array processor with p processors, where p less than or equal to n. Given m x n data points, we then present an O(mn/(p(1)p(2)))-time parallel algorithm for solving the uniform bicubic B-spline surface fitting problem on a pi x p, mesh-connected computer; where p(1) less than or equal to m and p(2) less than or equal to n. The relative error analyses of our two stable and cost-optimal parallel solvers are also given. When setting p(1) = m and p(2) = n, a constant-time parallel solver for B-spline surface fitting can be derived; this time- and cost-optimal result is a direct method, in contrast to the parallel iterative method of Cheng et al, (Parallel B-spline surface interpolation on a mesh-connected processor array, J. Parallel Distrib. Comput. 24, 2 (1995), 224-229). (C) 1996 Academic Press, Inc.
Keywords:
ALGORITHM
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available