An efficient algorithm of bounding interval triangular B-B (Bernstein-Béier) surfaces with lower degree interval triangular B-B surfaces is presented. The algorithm is based on linear programming techniques. An analytical method is also given for degree reduction of one order. The result of degree reduction approximation can be used for the purpose of data transmission among various CAD systems, as well as for the saving of computation time for some geometric operations.