Assertion: polyhedron's polygon | /r/CapableOf | intersect in empty set
Facets:
Source sentences:
text: In brief, it is that they are the subsets of Euclidean space that can be represented as the unions of finitely many convex polygons, with each two polygons intersecting in a vertex, edge, or empty set, with each point having a neighborhood topologically equivalent to a disk, and with the whole set connected.