A preliminary framework for geometric basis computing pattern

Geometric problems are usually solved by algebraic methods, which narrows the capacity of geometry. We represent a preliminary framework for geometric basis computing pattern. The pattern is based on He´s theory and solves the problems in the synthetic way. We define the geometric basis and use an axiomatic prover to generate a sequence of geometric bases. Computing is made according to the sequence. We also give an example to demonstration the feasibility of our approach.