GROEBNER BASIS SOLUTION OF PLANAR RESECTION PROBLEM
GROEBNER BASIS SOLUTION OF PLANAR RESECTION PROBLEM
复制标题
平面切除问题的 Groebner 基解
DOI:
10.1179/sre.2002.36.285.528
复制
发表时间:
2002
期刊:
影响因子:
1.6
通讯作者:
J. Awange
中科院分区:
文献类型:
--
作者:
J. Awange
Abstract The three nonlinear planar resection equations are usually solved analytically by first solving for the unknown orientation σ in the horizontal plane in a three-step procedure. The .first step is the elimination step, the second step is the division step and the third step is once again elimination step. Once the unknown orientation parameter in the horizontal plane has been determined, it is substituted back in any of the two of the initial nonlinear equations to obtain the position {x, y} of the observing unknown station. By making use of the Groebner basis technique, whose computing engine is the B. Buchberger algorithm, we obtain in a single step three direct relationship between the unknown planar resection elements {x, y, σ} (being the position {x, y} of the unknown observing station P ∈ E2 and the unknown orientation element σ in the horizontal plane) and the coordinates Xi, Yi|ì ∈ {1, 2, 3} of the known three target points Pi ∈ E2|ì ∈ {1, 2, 3} and the horizontal direction observations Ti|ì ∈{I, 2, 3} being made from the observing unknown station P ∈ E2 to the known three target points Pi ∈ E2|ì ∈ {I, 2, 3} whose coordinates Xi, Yi|ì ∈ {I, 2, 3} are known. These three direct relationships allow a faster computation of the unknowns {x, y, σ} and an easy implementation of the algorithm in laptops and programmable scientific calculators being carried by sunJeyors, engineers and architectures to the field The Groebner basis approach thus avoids the forward and backward steps of the classical analytical procedure.