%
% The algorithm maps this domain onto a tree in which each node
% represents a cube within that domain. In the following discussion
-% these cubes are defined by the coordinate of two opposite vertices:
-% The vertex nearest the origin in RGB space and the vertex farthest from
-% the origin.
+% these cubes are defined by the coordinate of two opposite vertices (vertex
+% vertex nearest the origin in RGB space and the vertex farthest from
+% the origin).
%
% The tree's root node represents the entire domain, (0,0,0) through
% (Cmax,Cmax,Cmax). Each lower level in the tree is generated by