NavList:

   

Reply

The program OpenCPN (free) has a plug in that does this for an arbitrary
number of observations.


On Tue, March 5, 2019 07:01, Bill Lionheart wrote:
> And the idea is quite simple. The circles of position from each sight
> is the intersection of a plane with the sphere. The planes intersect in a
> line, and it is easy to find the intersection points of a line with a
> sphere. I dont know who was teh first to do this.  For bonus points what
> is the probability contour in this case! (I don't know off hand)
>
> Bill
>
>
> On Mon, 4 Mar 2019 at 15:03, Andrés Ruiz 
> wrote:
>
>>
>> As a curiosity the paper by James Van Allen: "An analytical solution of
>> the two star sight problem of celestial navigation" February 1981 at
>> https://apps.dtic.mil/dtic/tr/fulltext/u2/a098626.pdf
>>
>>
>> Published: IoN Vol. 28, No. 1, Spring 1981
>>
>>
>> regards. --
>> Andrés Ruiz
>> Navigational Algorithms
>> http://sites.google.com/site/navigationalalgorithms/
>>
>>
>> 
>>
>
> :
> http://fer3.com/arc/m2.aspx/An-analytical-solution-two-star-sight-problem-
> celestial-Lionheart-mar-2019-g44483

   

Reply