Skip to Content.
Sympa Menu

cgal-discuss - Re: 2½D convex hull/pseudo traveling sa lesman problem (usenet thread)

Subject: CGAL users discussion list

List archive

Re: 2½D convex hull/pseudo traveling sa lesman problem (usenet thread)


Chronological Thread 
  • From: Olumide <>
  • To:
  • Subject: Re: 2½D convex hull/pseudo traveling sa lesman problem (usenet thread)
  • Date: Mon, 16 Apr 2007 19:58:52 +0100

Hi -

Sorry, but this is a computational geometry questions and not a CGAL one, but I reckon that there are a few computational geometry wizards here ...

I trying to solve a find a strategy for flying round any two countries say Russia and Brazil (considering that both countries lie on a sphere), in the shortest possible time.

Please refer to the following comp.graphics.algorithms thread http://tinyurl.com/28zom2

Thanks,

- Olumide



Archive powered by MHonArc 2.6.16.

Top of Page