A very simple application of this idea leads to the following straightforward algorithm for quasicontinuous renderings. The method does not even require overt transformation to and from the Fourier domain. Begin with an initially empty spectral vector with a fine spacing between rates. Parameterize the data using the ARM-LSQ method. For each coefficient in the discrete parsimonious representation of s , enter the amplitude of the component at the position in the spectral vector that is closest to the rate associated with the component. This is called a spike representation in this report. Convolve the resulting spike representation with a broadening function whose width corresponds to the resolution of the data. A reasonable choice for broadening is a Gaussian shape, though more carefully chosen shapes may be appropriate. Behind the scenes, convolution algorithms may work in a Fourier domain, but that detail is unimportant for practical implementation using high-level programming tools.