comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: Calculation of intersection on map
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: Calculation of intersection on map [message #71753 is a reply to message #71667] Wed, 14 July 2010 16:14 Go to previous message
bjkuk is currently offline  bjkuk
Messages: 16
Registered: July 2010
Junior Member
On 7월14일, 오후10시49분, "Kenneth P. Bowman" <k-bow...@null.edu> wrote:
> In article
> < 780593a9-2c5b-44fe-9905-d3a06c89c...@i18g2000pro.googlegroup s.com >,
>
> bjkuk <bjku...@gmail.com> wrote:
>> Dear All,
>> I am looking for pre-made routine or proramming tips to get
>> intersection. I would like to calculate intersection from given two
>> positions(A and B)
>
>> If we know Latitude and Longitude of Point-A and Point-B, also the
>> azimuth angles of Point-A and Point-B from the North. if azimuth
>> angles is not parellel, those two lines will be cross. How do I
>> calcuate this intersection point (cross point) precisely?
>
>> Sincerely Yours
>> B.J.Kuk
>
> Have a look at "Intersection of two paths given start points
> and bearings" on this page
>
> http://www.movable-type.co.uk/scripts/latlong.html
>
> BTW, the bearing lines always intersect,even if the azimuth
> angles are the same. A proper bearing line follows a great
> circle. On a sphere, great circles either are
> the same circle, or they intersect at two antipodal points.
>
> Ken Bowman

Thanks lot Ket Bowman.
The site you mentioned is very useful for me.

B.J. Kuk
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Previous Topic: Re: How to allocate memory for an array of more than 2G
Next Topic: How to allocate memory for an array of more than 2G

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Sat Nov 29 03:34:16 PST 2025

Total time taken to generate the page: 0.56217 seconds