Round 2: Tossup 17

In 1987, Lorensen and Cline developed an algorithm that constructs these objects using a table of 15 configurations. Bernard Chazelle developed an algorithm applied (-5[1])to these objects that runs in linear time by using “visibility maps.” Structures consisting of these objects may be “unwrapped” into UV coordinates. (-5[1])Hardware constraints induce a namesake “budget” for these objects on the order of 10,000. These objects are partitioned using an algorithm that identifies so-called “ears” and removes them. These objects are (-5[1])selectively removed from (-5[1])out of view to improve performance during “culling.” (-5[2])These objects are formed from sets (-5[1])and subdivided in a process named for Delaunay. (10[3])A namesake (10[1])mesh (10[2])of these (10[1])objects is used in the wire-frame model in computer graphics. (-5[1])For 10 points, (-5[1])what closed, planar shapes (10[1])consist of connected line segments? (10[2])■END■ (10[6]0[5])

ANSWER: polygons [accept triangles or faces or facets; accept polygon meshes or triangular meshes or triangular facets; prompt on meshes until read by asking “what do those consist of?”; prompt on shapes or closed curves or convex hulls]
<Brown, Other Science> | B. Prelims 2 - Northwestern A + Virginia Tech + Brown + Penn State
= Average correct buzzpoint

Back to tossups