A numerical method for solving the horizontal resection problem in Surveying
The three-point resection problem, i.e., the problem of obtaining the position of an unknown point from relative angular measurements to three known stations is a basic operation in surveying engineering. In the last centuries, a number of approaches to solve this problem have been developed. In this note, a new numerical approach to solve this problem is presented. The method uses only basic formulae from coordinate geometry. We present also numerical simulations that show the good performance and accuracy of this approach.
References
Burtch R., 2005, Three point resection problem. Surveying computations course notes 2005/2006 http://www.ferris.edu/faculty/burtchr/sure215/notes/resection.pdfSearch in Google Scholar
Font-Llagunes J. M., Batlle A. 2009, New Method That Solves the Three-Point Resection Problem Using Straight Lines Intersection, J. Surv. Eng. 135(2), 39-4510.1061/(ASCE)0733-9453(2009)135:2(39)Search in Google Scholar
Freudenthal H, 1968, Mathematik in Wissenschaft und Alltag, (Kindler Verlag, München)Search in Google Scholar
Klinkenberg H. 1955, Coordinate systems and the three-point problem, Can. Surveyor 9, 508-51810.1139/tcs-1955-0025Search in Google Scholar
This content is open access.
