Definition 3.2 . [02KD]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
Definition 3.2.
Let be a non-empty collection of convex subsets of . The collection is called a convex subdivision if it satisfies the conditions:
- (1)
every face of an element of is also in ;
- (2)
every two elements of are either disjoint or they intersect in a common face.
If satisfies only (2), then it is called a convex decomposition. The support of is defined as the set . We say that is complete if its support is the whole of . For a given set , we say that is a convex subdivision (or decomposition) in whenever . A convex subdivision in is called complete if .