Assertion: dissection | /r/HasProperty | finite set of triangles
Facets:
Source sentences:
text: A dissection of a polygon P is a finite set of triangles that do not overlap and whose union is all of P. A dissection into n triangles is called an n-dissection, and it is classified as an even dissection or an odd dissection according to whether n is even or odd.