Question

These shapes can be efficiently anti-aliased using a prefiltering method developed by McNamara, McCormack, and Jouppi. These shapes are drawn by one of the earliest computer graphics algorithms, made in 1962, that is essentially a fast digital differential analyzer that avoids floating-point operations. OpenGL has namesake LOOP and STRIP primitives for drawing linked instances of this shape. (-5[1])In an (-5[1])SVG, this shape can be drawn with an M command followed by an H, V, or L command. It’s not a circle, but Xiaolin Wu developed an anti-aliasing algorithm for this shape that builds on the (*) Bresenham algorithm for drawing it. Bézier (“BEH-zee-ay”) curves with two control points are these shapes. Connecting a series of (10[1])these shapes results in a chain sometimes called a “poly-[this shape]”. For 10 points, name these basic shapes in computer graphics, which on paper can be drawn with a straightedge. ■END■ (10[3])

ANSWER: lines [accept line segments; accept edges before “straightedge”]
<AW>
= Average correct buzz position
Conv. %Power %Average Buzz
100%0%135.25

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Jerry VinokurovEight Megabytes And Constantly Swappinga neural-net processor; a thinking machine56-5
Eric BobrowDianetics for DiabeticsMacro Editors58-5
Kevin YeWe Bought a Complexity Zoo Storyplaying emacs while my parents are arguing11210
Aseem KeyalMacro EditorsDianetics for Diabetics14310
Kevin Wanga neural-net processor; a thinking machineEight Megabytes And Constantly Swapping14310
Matt Jacksonscreaming into the public static void main(String[] args)Edwardian Manifestation of All Colonial Sins14310