|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Jonathan Yen, Susan Spach, Mark Smith, Ron Pulleyblank, "Parallel Boxing in B-Spline Intersection," IEEE Computer Graphics and Applications, vol. 11, no. 1, pp. 72-79, January/February, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/38.67703, author = {Jonathan Yen and Susan Spach and Mark Smith and Ron Pulleyblank}, title = {Parallel Boxing in B-Spline Intersection}, journal ={IEEE Computer Graphics and Applications}, volume = {11}, number = {1}, issn = {0272-1716}, year = {1991}, pages = {72-79}, doi = {http://doi.ieeecomputersociety.org/10.1109/38.67703}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Computer Graphics and Applications TI - Parallel Boxing in B-Spline Intersection IS - 1 SN - 0272-1716 SP72 EP79 EPD - 72-79 A1 - Jonathan Yen, A1 - Susan Spach, A1 - Mark Smith, A1 - Ron Pulleyblank, PY - 1991 VL - 11 JA - IEEE Computer Graphics and Applications ER - | |||
A modified formulation of oriented boxing called oriented slab boxing is presented. It almost doubles the speed of the oriented boxing component in B-spline intersection. The method used to accelerate B-spline intersection includes algorithmic improvements and parallelization of the algorithm at different levels of granularity to find an optimum solution on a network of parallel processors. The software testbed is linked to a B-spline-based library, which is a prototype of what may be used in an actual engineering design environment. A parallel implementation of the algorithm on a network of three processors achieves an additional twofold improvement in speed.
1. G. Wang, "The Subdivision Method for Finding the Intersection Between Two Bezier Curves or Surfaces,"Zhejiang Univ. J., Special Issue on Computational Geometry, 1984, pp. 108-119.
2. S.W. Thomas,Modelling Volumes Bounded by B-Spline Surfaces, doctoral dissertation, Univ. of Utah, Salt Lake City, 1984.
3. Q.S. Peng, "An Algorithm for Finding the Intersection Lines Between Two B-Spline Surfaces,"Computer-Aided Design, Vol. 16, No. 4, July 1984, pp. 191-196.
4. T. Dokken, "Finding Intersections of B-Spline Represented Geometries Using Recursive Subdivision Techniques,"Computer Aided Geometric Design, Vol. 2, No. 1-3, Sept. 1985, pp. 189-195.
5. E.G. Houghton et al., "Implementation of a Divide-and-Conquer Method for Intersection of Parametric Surfaces,"Computer Aided Geometric Design, Vol. 2, No. 1-3, Sept. 1985, pp.173-183.
6. D.J. Filip, R.P. Markot, and R.L. Magedson, "Surface Algorithms Using Bounds on Derivatives,"Computer Aided Geometric Design, Vol. 3, 1987, pp. 295-311.
7. M.J. Pratt and A.D. Geisow, "Surface/Surface Intersection Problems," inThe Mathematics of Surfaces, J.A. Gregory, ed.. Oxford Univ. Press, Oxford, UK, 1986, pp. 117-142.
8. R.E. Barnhill et al., "Surface/Surface Intersection,"Computer Aided Geometric Design, Vol. 4, No. 1-2, July 1987, pp. 3-16.
9. S. Katz and T. Sederberg, "Genus of the Intersection Curve of Two Rational Surface Patches,"Computer Aided Geometric Design, Vol. 5, No. 3, Sept. 1988, pp. 253-258.
10. W.J. Gordon and R.F. Riesenfeld, "B-Spline Curves and Surfaces," inComputer Aided Geometric Design, Academic Press, New York, 1974, pp. 95-126.
11. T. Kay and J.T. Kajiya, "Ray Tracing Complex Scenes,"Computer Graphics(Proc. SIGGRAPH), July 1986, pp. 269-278.
12. J. Yen et al., "A First Step Toward Parallel Processing for B-Spline Surface Intersection Calculation,"Proc. Int'l Conf CAD and Computer Graphics. Beijing, International Academic Publishers, Beijing, 1989, pp. 209-215.