The similarity map, a 2D matrix, represents a measure of the similarity between every possible combination of isosurface in the volumes. For example, the value of the map at x = ( 5, 24 ) is a measure of the mutual information between isosurface of value 5 in the first volume and isosurface of value 24 in the second volume. Each cell in the map is computed by first building a distance map for each of the volumes. The distance map is a volume in which each voxel contains the shortest distance to the considered isosurface. Then, the mutual information of the 2 volumes is computed and become an entry in the similarity map.
The similarity map can be used as an intuitive way to define a transfer function. Users can place points on the similarity map at interesting locations and assign colors and opacity to those points. The contribution of each sample in the volume to the final rendering is computed by using the colors and opacity of the nearest neighbor control points in similarity space. The figure below shows a similarity map with the control points on the left and the resulting volume rendering on the right.
![]() |
| Image from the paper available here |




