ScalingStacks

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 Π\Pi be a non-empty collection of convex subsets of NℝN_{\mathbb{R}}. The collection Π\Pi is called a convex subdivision if it satisfies the conditions:

  1. (1)

    every face of an element of Π\Pi is also in Π\Pi;

  2. (2)

    every two elements of Π\Pi are either disjoint or they intersect in a common face.

If Π\Pi satisfies only (2), then it is called a convex decomposition. The support of Π\Pi is defined as the set |Π|=⋃C∈ΠC|\Pi|=\bigcup_{C\in\Pi}C. We say that Π\Pi is complete if its support is the whole of NℝN_{\mathbb{R}}. For a given set E⊂NℝE\subset N_{\mathbb{R}}, we say that Π\Pi is a convex subdivision (or decomposition) in EE whenever |Π|⊂E|\Pi|\subset E. A convex subdivision in EE is called complete if |Π|=E|\Pi|=E.

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.