Circle-circle intersection. A universal method for solving typical surveying problems

被引:0
|
作者
Gargula, Tadeusz [1 ]
机构
[1] Agr Univ Krakow, Dept Land Surveying, Balicka 253A, PL-30198 Krakow, Poland
关键词
Field measurements; Distance-distance intersection; Circle-circle intersection; Numerical algorithm; GPS; NETWORKS;
D O I
10.1007/s12518-024-00598-z
中图分类号
TP7 [遥感技术];
学科分类号
081102 ; 0816 ; 081602 ; 083002 ; 1404 ;
摘要
The research problem of the article is to devise a universal mathematical procedure for calculating point coordinates from typical planar surveying measurements. The proposed solution involves calculating the intersection points of two circles with radii equal to the measured distances (the distance-distance intersection problem). The author demonstrates a straightforward method for reducing every typical surveying problem to the distance-distance intersection form. The procedure also verifies the accuracy of the calculated coordinates. The derived equations were tested numerically using practical examples. The devised procedure will be integrated into an exhaustive numerical algorithm for diverse surveying problems regardless of the geometric approach during measurements.
引用
收藏
页码:1047 / 1056
页数:10
相关论文
共 30 条
  • [1] A Circle Intersection Method for Bi-Objective Optimization
    Zhou, Jianhua
    Li, Mian
    Fu, Xiaojin
    JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING, 2021, 21 (06)
  • [2] On method of osculating circle for solving nonlinear equations
    Kanwar, V.
    Singh, SukhJit
    Guha, R. K.
    Mamta
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 176 (01) : 379 - 382
  • [3] A Reliable Area Reduction Technique for Solving Circle Packing Problems
    M. C. Markót
    T. Csendes
    Computing, 2006, 77 : 147 - 162
  • [4] A reliable area reduction technique for solving circle packing problems
    Markót, MC
    Csendes, T
    COMPUTING, 2006, 77 (02) : 147 - 162
  • [5] Applying the double side method of weighted residual for solving circle plate large deformation problems
    Chang, CL
    Lee, ZY
    APPLIED MATHEMATICS AND COMPUTATION, 2003, 141 (2-3) : 477 - 490
  • [6] A NORMALIZED CIRCLE INTERSECTION METHOD FOR BI-OBJECTIVE OPTIMIZATION PROGRAMMING
    Zhou, Jianhua
    Xia, Tingting
    Li, Mian
    Xu, Min
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2017, VOL 2B, 2017,
  • [7] Improved interval methods for solving circle packing problems in the unit square
    Mihály Csaba Markót
    Journal of Global Optimization, 2021, 81 : 773 - 803
  • [8] Improved interval methods for solving circle packing problems in the unit square
    Markot, Mihaly Csaba
    JOURNAL OF GLOBAL OPTIMIZATION, 2021, 81 (03) : 773 - 803
  • [9] Universal method for solving the dynamic problems
    Shanghai Univ, Shanghai, China
    Appl Math Mech Engl Ed, 7 (665-676):
  • [10] Analysing non-coaxial folding effects in the Small Circle Intersection method
    Calvin, P.
    Pueyo, E. L.
    Ramon, M. J.
    Casas-Sainz, A. M.
    Villalain, J. J.
    GEOPHYSICAL JOURNAL INTERNATIONAL, 2020, 222 (02) : 940 - 955