Parallel curve Algorithm
The parallel method used in curve generation is similar to
displaying the method used in a segment . We can either use sequential algorithms to assign processors by curve segment , or we may suggest other ways to assign processors to different areas of the screen .
The
parallel midpoint method for displaying circles is to divide the arcs of
45° to 90 ° into equal-eldest arcs and configure a processor for each satin arc.
then similar to the parallel Bresenham line drawing algorithm , we need to establish the initial Y value for each processor and determine the parameter P
k then calculates the pixel position of the entire sub-arc and obtains the position in the other eight circles through symmetry. Similarly, the parallel ellipse midpoint algorithm divides the elliptical arcs in the first quadrant into equal-length arcs and assigns them to each processor, and the pixel locations in other quadrants can be obtained by symmetry. and the ellipse's screen segmentation scheme is to assign each scan line that intersects the curve to the appropriate processor. At this point, each processor calculates the intersection coordinates of a curve and a scan line based on the circle or ellipse equation.
for . Each processor applies a curve equation to determine the location of the intersection with the scan line for which it is set. After assigning a set of pixels to each processor, the processor calculates the distance (or square of the distance) of each pixel to the curve. If the calculated distance is less than the pre-specified value, the pixel is drawn. Computer Graphics (ii) output element _7_ parallel curve algorithm
