Abstract. Cayley algebra and bracket algebra are important approaches to invariant computing in projective and affine geometries, but there are some difficulties in doing algebraic computation. In this paper we show how the principle “breefs ”  – bracketoriented representation, elimination and expansion for factored and shortest results, can significantly simply algebraic computations. We present several typical examples on conics and make detailed discussions on the procedure of applying the principle to automated geometric theorem proving