Dear Pavlo, intersections are computed internally for unknown points without given approximate coordinates. Unfortunately there is no explicit user interface. So, you simply need to define a trivial network with two/three given points and one unknown point without coordinates and with intersection observations and try what gama would produce ... as you know, intersections are not always unique. Ales
On 10 September 2017 at 08:22, Pavlo Karbovnyk <[email protected]> wrote: > Thanks for great program. > > Quick question: > > How to do resection ? > > Solve for a unknown position measuring angles and distances with > respect to known positions ? > > Regards Pavlo. > > _______________________________________________ > Info-gama mailing list > [email protected] > https://lists.gnu.org/mailman/listinfo/info-gama >
_______________________________________________ Info-gama mailing list [email protected] https://lists.gnu.org/mailman/listinfo/info-gama
