home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!europa.asd.contel.com!darwin.sura.net!convex!news.utdallas.edu!corpgate!brtph560!nrtpa038!cadnews
- From: Madeleine Thomas
- Subject: HELP!! Inscribed Circle Problem
- Message-ID: <1992Aug27.130327.12435@nrtpa038.bnr.ca>
- Sender: cadnews@nrtpa038.bnr.ca (netnews posting host)
- Organization: Bell-Northern Research
- Date: Thu, 27 Aug 1992 13:03:27 GMT
- Lines: 33
-
- HELP! HELP! HELP!
-
- Surely one of you math whizzes can assist me?
-
- I'm writing a computer program that needs to do
- the following: given two points on earth, call them 'a' and 'b';
- each point being in lat/long coordinates,
-
- a) find the shortest distance between the points;
- b) given point 'b' and a distance 'R', what is the quickest method of
- determining
- whether another point 'c' is in the circle defined by radius R around point
- 'b'.
-
- I have over 6 million data points to search through.
-
- or, stated another way;
-
- I know that Jane lives in Washington, DC, at Lat X, Long Y. I have a list of
- all
- the K-Marts in the entire world (with their respective Lat-Long coordinates).
-
- a) what is the closest one to her? How far is it?
- b) list all K-Marts within distance R from Jane.
-
- All suggestions/answers appreciated!
-
- Thanks in advance!!!
-
- Madeleine Thomas
-
- P.S. I have to write this thing today...for some VP that the boss promised it
- too!
-