GaussianMatrix[r] gives a matrix that corresponds to a Gaussian kernel of radius r. GaussianMatrix[{r, \[Sigma]}] gives a matrix corresponding to a Gaussian kernel with ...
DiscretePlot3D[expr, {i, i_min, i_max}, {j, j_min, j_max}] generates a plot of the values of expr when i runs from i_min to i_max and j runs from j_min to ...
Graphics3D[primitives, options] represents a three-dimensional graphical image.
ListLogPlot[{y_1, y_2, ...}] makes a log plot of the y_i, assumed to correspond to x coordinates 1, 2, ....ListLogPlot[{{x_1, y_1}, {x_2, y_2}, ...}] makes a log plot of the ...
RevolutionPlot3D[f_z, {t, t_min, t_max}] generates a plot of the surface of revolution with height f_z at radius t.RevolutionPlot3D[f_z, {t, t_min, t_max}, {\[Theta], ...
SphericalPlot3D[r, \[Theta], \[Phi]] generates a 3D plot with a spherical radius r as a function of spherical coordinates \[Theta] and \[Phi].SphericalPlot3D[r, {\[Theta], ...
WaveletThreshold[dwd] thresholds the detail wavelet coefficients in the DiscreteWaveletData object dwd.WaveletThreshold[dwd, tspec] thresholds the coefficients using the ...
FourierDST[list] finds the Fourier discrete sine transform of a list of real numbers.FourierDST[list, m] finds the Fourier discrete sine transform of type m.
Constructing matrices with special shapes. This creates a matrix of 0s containing a radius 4 diamond of 1s. The result is a 9×9 matrix. The size of the matrix can be ...
Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...