Strongly 2-shape-sortability of vector partitions

Partitioning points optimally in ℝ¹ have been well studied. Hwang et al. (2003) first extended the optimal partitioning problems from ℝ¹ to ℝ^d . In particular, they studied the "sortability" of some partition properties. They also constructed examples to show that some partition properties, like Disjoint and Cone disjoint, are not sortable under some constraints S. In this note we construct a more concise example than theirs and also prove that another partition property, Nonpenetrating, is not sortable under S.