We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive
definite matrix under unimodular integral transformations. We use characteristic sets
of short vectors and partition-backtracking graph software. The algorithm runs
in a number of arithmetic operations that is exponential in the dimension
, but
it is practical and more efficient than canonical forms based on Minkowski
reduction.