Parallel architecture for conversion of NURBS curves to Be/spl acute/zier curves

NURBS are one of the most common methods of representing curves and surfaces in the geometric modeling and computer graphics fields, whilst numerous computer graphics algorithms are based on the utilization of a simpler representation of the same curves and surfaces: Be/spl acute/zier representations. In this paper, we present a parallel architecture to perform the decomposition of a NURBS curve into its constituent Be/spl acute/zier polynomial pieces. This architecture presents a regular and easily scalable structure, suitable for VLSI implementation, which can be efficiently exploited for the decomposition process. The performance of the proposed architecture is improved by the use of carry-save arithmetic, which permits the reduction of the system cycle time.

[1]  Vojin G. Oklobdzija,et al.  An algorithmic and novel design of a leading zero detector circuit: comparison with logic synthesis , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Tomoyuki Nishita,et al.  Ray tracing trimmed rational surface patches , 1990, SIGGRAPH.

[3]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

[4]  M. Carter Computer graphics: Principles and practice , 1997 .

[5]  Javier D. Bruguera,et al.  Parallel architecture for the computation of NURBS surfaces , 1999, Electronic Imaging.

[6]  Anselmo Lastra,et al.  Interactive Display of Large NURBS Models , 1996, IEEE Trans. Vis. Comput. Graph..

[7]  Meenakshisundaram Gopi,et al.  A Unified Architecture for the Computation of B-Spline Curves and Surfaces , 1997, IEEE Trans. Parallel Distributed Syst..

[8]  Dinesh Manocha,et al.  Algebraic pruning: a fast technique for curve and surface intersection , 1997, Comput. Aided Geom. Des..