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. In an 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 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■
Buzzes
Summary
| Tournament | Edition | Exact Match? | TUH | Conv. % | Power % | Neg % | Average Buzz |
|---|---|---|---|---|---|---|---|
| EMACS at CO | 08/06/2023 | N | 4 | 100% | 0% | 50% | 135.25 |
| EMACS Online | 10/01/2023 | Y | 5 | 100% | 20% | 40% | 116.60 |