|
[Date Index]
[Thread Index]
[Author Index]
Spherical trig application
- To: mathgroup at smc.vnet.net
- Subject: [mg2209] Spherical trig application
- From: Roger Uribe <ui at uribe.demok.co.uk>
- Date: Mon, 16 Oct 1995 11:53:36 -0400
Given a roughly convex polygon on the Earth's surface - typically 1000
miles "diameter" and 3 - 12 vertices. I need to know whether a given
point is in it or not. There are about 10,000+ such points to test so
I need an effecient method.
Any ideas, or know of any software that will do something like it.
I guess defining the enclosing circle and discarding any points
outside that would get rid of most of them.
I don't want a lesson in spherical trig, I'm no expert but I know
enough, it's the methods and short cuts I'm after.
Thanks Roger.
Prev by Date:
Re: Why gives Plot[GTK,{q,o,30}] negat. min. at q=15 ? (GTK:=1/3 q^2 - 10 q + 100)
Next by Date:
Formating output of Modules
Previous by thread:
Spherical trig application
Next by thread:
Re: Spherical trig application
|