Xref: utzoo sci.aeronautics:43 comp.graphics:7486 sci.math:7862
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!ut-emx!walt.cc.utexas.edu!mentat
From: mentat@walt.cc.utexas.edu (Robert Dorsett)
Newsgroups: sci.aeronautics,comp.graphics,sci.math
Subject: Plotting great-circle tracks
Message-ID: <18393@ut-emx.UUCP>
Date: 14 Sep 89 22:46:42 GMT
Sender: news@ut-emx.UUCP
Reply-To: mentat@walt.cc.utexas.edu (Robert Dorsett)
Distribution: usa
Organization: The University of Texas at Austin, Austin, Texas
Lines: 17


I'm looking for references to algorithms that can take two coordinates
on a sphere, and produce a set of points that describe the shortest path
between those two points.  The closer these algorithms come to carto-
graphic techniques of plotting great circle tracks in a two-dimensional
space, the better.

Please respond by email; I'll summarize in a week or so.






Robert Dorsett                                   
Internet: rdd@rascal.ics.utexas.edu               
UUCP: ...cs.utexas.edu!rascal.ics.utexas.edu!rdd