Before revision: {\cal  {\cal  _1,...,{\cal P}_m, for the data reduction purpose, one way to summarize their topological features is to compute the {\em center} {\cal C} of them . Let P_i be the set of feature points in P _i. Here we mainly focus on the two discrete versions when points in C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
After revision: {\cal {\cal _1,...,{\cal P}_m, for the data reduction purpose, one way to summarize their topological features is to compute the {\em center} {\cal C} of them  P _i. Here we mainly focus on the two discrete versions when points in C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).