Voronoi tilings are dual to a type of this procedure named for Delaunay.
A linear time algorithm for this process was found by Chazelle. Steve Fisk solved the art gallery problem by performing this procedure on a cycle and 3-coloring the resulting graph. The nth Catalan number counts the number of ways to do this process on a polygon with n-plus-2 vertices. Voronoi tilings are dual to a type of this procedure named for Delaunay. One technique with this name uses angles from two fixed points to locate a third point and relies on the law of sines. The angle sum of an n-gon can be computed by performing this process and then noting that each of the n-minus-2 pieces has an angle sum of 180 degrees. For 10 points, identify this process of breaking up a region into three-sided figures.
A linear time algorithm for this process was found by Chazelle.
triangulation [accept word forms; accept Delaunay triangulation; prompt on tessellation] &lt;Prince&gt;