Re: Resection

Aleš Čepek <[email protected]> Mon, 11 Sep 2017 11:23:54 +0200
Newsgroups gmane.comp.gnu.gama.announce
Message-ID <CAGN9seQvs71ewd3DNaBEKnNDqc8M28yKqm1ke_HnX-kOTXhP6w@mail.gmail.com>
--===============2401605449303475163==
Content-Type: multipart/alternative; boundary="001a11440c9c4bc79f0558e67c38"

--001a11440c9c4bc79f0558e67c38
Content-Type: text/plain; charset="UTF-8"

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
>

--001a11440c9c4bc79f0558e67c38
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>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 netw=
ork with two/three given points and one unknown point without coordinates a=
nd with intersection observations and try what gama would produce ... as yo=
u know, intersections are not always unique.<br></div>Ales <br></div><div c=
lass=3D"gmail_extra"><br><div class=3D"gmail_quote">On 10 September 2017 at=
 08:22, Pavlo Karbovnyk <span dir=3D"ltr">&lt;<a href=3D"mailto:pavlo.16@gm=
ail.com" target=3D"_blank">[email protected]</a>&gt;</span> wrote:<br><blo=
ckquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1px #c=
cc solid;padding-left:1ex">Thanks for great program.<br>
<br>
Quick question:<br>
<br>
How to do resection ?<br>
<br>
Solve for a unknown position measuring angles and distances with<br>
respect to known positions ?<br>
<br>
Regards Pavlo.<br>
<br>
______________________________<wbr>_________________<br>
Info-gama mailing list<br>
<a href=3D"mailto:[email protected]">[email protected]</a><br>
<a href=3D"https://lists.gnu.org/mailman/listinfo/info-gama" rel=3D"norefer=
rer" target=3D"_blank">https://lists.gnu.org/mailman/<wbr>listinfo/info-gam=
a</a><br>
</blockquote></div><br></div>

--001a11440c9c4bc79f0558e67c38--


--===============2401605449303475163==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
Info-gama mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/info-gama

--===============2401605449303475163==--