A centroid- and covariance-invariant deterministic mapping of sets of discrete data points to nonlinear models is introduced. Conditions for bijectivity of this mapping are developed. Since the mapping can be accomplished by look-up tables for the special case of equally-spaced data, the resulting mapping algorithm is considered computationally fast. This could be attractive for real-time operations.