article

Free access

Cost-optimal parallel B-spline interpolations

Authors:

Kuo-Liang Chung,

Ferng-Ching Lin,

Wen-Chin ChenAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 18, Issue 3b

Pages 121 - 131

https://doi.org/10.1145/255129.255147

Published: 01 June 1990 Publication History

Abstract

We show how to transform the B-spline curve and surface fitting problems into suffix computations of continued fractions. Then a parallel substitution scheme is introduced to compute the suffix values on a newly proposed mesh-of-unshuffle network. The derived parallel algorithm allows the curve interpolation through n points to be solved in O(logn) time using Θ(n/log n processors and allows the surface interpolation through m × n points to be solved in O(log m log n) time using Θ(mn/(log m log n)) processors. Both interpolation algorithms are cost-optimal for their respective problems. Besides, the surface fitting problem can be even faster solved in O(log m + log n) time if Θ(mn) processors are used in the network.

References

[1]

R. E. Barnhill and R. F. Riesenfeld (eds.), Computer Aided Geometric Design, Academic Press, New York, 1974.

Digital Library

[2]

B. A. Barsky and D. P. Greenberg, Determining a set of B-spline control vertices ~o generate an interpolating surface, Comput. Graphics Image Process. 14, 3, 1980, 203-226.

[3]

D. P. Bertsekas and J. N. Tsit.siklis, Parallel and Distributed Computation" Numerical Methods, Prentice- Hall, Englewood Cliffs, New Jersey, 1989.

Digital Library

[4]

C. de Boor, A Practical Guide to Splines, Springer- Verlag, New York, 1978.

[5]

F. H. Cheng and A. Goshtasby, A parallel B-spline surface fitting algorithm, ACM Trans. on Graphics 8, 1,1989, 41-50.

Digital Library

[6]

K. L. Chung, W. C. Chen and F. C. Lin, Fast computation of periodic continued fractions, Information Processing Letters 33, 2, 1989, 67-72.

Digital Library

[7]

K. L. Chung, F. C. Lin and W. C. Chen, Parallel computation of continued fractions, submitted for publication.

[8]

I. D. Faux and M. J. Pratt, Computational Geomefry /'or Design and Manufacture, Wiley, New York, 1979.

Digital Library

[9]

C. F. Gerald and P. O. Wheatley, Applied Numerical Analysis, 4th eel., Addison-Wesley, New York, 1989.

[10]

S. L. Johnsson, Solving tridiagonal systems on ensemble architectures, SIAM J. Sci. Sta. Comput. 8, 3, 1987, 354-392.

Digital Library

[11]

F. C. Lin and K. L. Chung, A cost-optimal parallel tridiagonal system solver, to appear in Parallel Computing.

[12]

R. M. Owens and J. Ja'Ja', Parallel sorting with serial memories, IEEE Trans. Comput. C-84, 4, 1985, 379-383.

Digital Library

[13]

T. Pavlidis, Curve fitting as a pattern recognition problem, in Proc. 1982 In~. Conf. on Pa~tern Recognition, ~EE Computer Society Press, Silver Spring, Md., 1982, 853-859.

[14]

B. Pham, Conic B-spline for curve fitting: a unifying approach, Comput. Graphics Image Process. 45, 1, 1989, I17-125.

Digital Library

[15]

H. S. S tone, Parallel tridiagonal equation solvers, ACM Trans. Math. So{tware 1, 4, 1975, 289-307.

Digital Library

Cited By

Ahmadi HNaeini MSarbazi-azad H(2005)Efficient SIMD numerical interpolationProceedings of the First international conference on High Performance Computing and Communications10.1007/11557654_21(156-165)Online publication date: 21-Sep-2005
https://dl.acm.org/doi/10.1007/11557654_21

Index Terms

Recommendations

Cost-optimal parallel B-spline interpolations
ICS '90: Proceedings of the 4th international conference on Supercomputing

We show how to transform the B-spline curve and surface fitting problems into suffix computations of continued fractions. Then a parallel substitution scheme is introduced to compute the suffix values on a newly proposed mesh-of-unshuffle network. The ...
Planar Pythagorean-Hodograph B-Spline curves

We introduce a new class of planar Pythagorean-Hodograph (PH) B-Spline curves. They can be seen as a generalization of the well-known class of planar Pythagorean-Hodograph (PH) Bzier curves, presented by R. Farouki and T. Sakkalis in 1990, including the ...
Parallel B-Spline Surface Fitting on Mesh-Connected Computers

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 approximateO(n/p)-time parallel B-spline curve fitting algorithm for finding the ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 18, Issue 3b

Special Issue: Proceedings of the 4th international conference on Supercomputing

Sept. 1990

489 pages

ISSN:0163-5964

DOI:10.1145/255129

Chairmen:
Ahmed Sameh
Univ. of Illinois at Urbana-Champaign, Urbana
,
Henk van der Vorst
Delft Univ. of Technology and CWI, The Netherlands

Issue’s Table of Contents

ICS '90: Proceedings of the 4th international conference on Supercomputing
June 1990
492 pages
ISBN:0897913698
DOI:10.1145/77726
Chairmen:
Ahmed Sameh
Univ. of Illinois
,
Henk van der Vorst
Delft Univ. of Technology and CWI, The Netherlands

Copyright © 1990 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1990

Published in SIGARCH Volume 18, Issue 3b

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
236
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)5

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ahmadi HNaeini MSarbazi-azad H(2005)Efficient SIMD numerical interpolationProceedings of the First international conference on High Performance Computing and Communications10.1007/11557654_21(156-165)Online publication date: 21-Sep-2005
https://dl.acm.org/doi/10.1007/11557654_21

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents