Subject: CGAL users discussion list
List archive
- From: "Andy Hirsh" <>
- To:
- Subject: path optimization
- Date: Mon, 7 Apr 2008 14:00:00 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=mxmNLsMI2JFml8Ec2+fGBJW9gfdfWWw6PDaqoxyCJ22NTz/Dnbw69M1/hZADHWBoCIulgPyUuOxhEvUDsDJS9CKWXIKoJcPNOudoAb2dVIJG2+W3JCPYxmkoMsLkC/H/bwQdT7F1TJb7r6DPR3Ge+BADKVHH4GBKXytlbs30dow=
Hi all
I'm totally new on CGAL... so excuse me if this is a stupid question :-)
for an optimization algorithm I would like to know if there is a way
to evaluate the minimum path along some (eg 1000) vectors using
CGAL... all vectors need to be traversed only once, I can
change the directions of vectors and I can also add some "jump
vectors" if needed...
thank a lot for any idea
Andy
- path optimization, Andy Hirsh, 04/07/2008
- Re: [cgal-discuss] path optimization, Bernd Gaertner, 04/07/2008
- Re: [cgal-discuss] path optimization, Andy Hirsh, 04/07/2008
- Re: [cgal-discuss] path optimization, Bernd Gaertner, 04/07/2008
Archive powered by MHonArc 2.6.16.