Applying multiresolution decomposition to different types of surfaces (possibly C¹ discontinuous), one can preserve, during the multiresolution editing process, the general nature of a freeform model on the one hand, and local features, such as bumps and geometric discontinuities, on the other hand.

The multiresolution decomposition of a NUB tensor product surface is computed via the symbolic computation of the inner product of projections of B-spline basis functions. Representations for the products of the B-spline basis functions can be found by solving an equivalent interpolation problem, whereas the integral of the result is derived with the aid of a closed form formulation.

The speaker discussed high-level typeface representations, which he terms Parametric Typographic Representations (PTRs). He presented an algorithm for automatically extracting typographic elements of typefaces from their outline representation, which is an essential initial step in converting typefaces from outline representations to PTRs. The extracted typographic elements include serifs, bars, stems, slants, bows, arcs, curve stems and curve bars. Most notable is the treatment of serifs, which are represented by finite-automata. The algorithm only needs to learn a serif type once, and is then capable of automatically recognizing it in different typefaces.

The speaker showed an application of a PTR for automatic high-quality hinting of fonts, which is one of the most important stages in digital font production. His system was used to generate hints for dozens of thousands of Kanji, Roman and Hebrew characters.