30 Aug
2013
30 Aug
'13
3:21 p.m.
With a good convex-hull algorithm, this would make a nice exercise in genetic programming: create a bunch of random polyline critters and let the ones with the biggest convex hulls reproduce and mutate. On Fri, Aug 30, 2013 at 4:04 PM, Dan Asimov <dasimov@earthlink.net> wrote:
I'd certainly think that would have the maximum for a 4-segment closed polygon: 4 consecutive edges of a regular tetrahedron that returns to where it started.
--Dan
On 2013-08-30, at 12:45 PM, Cris Moore wrote:
the path on the edges of a tetrahedron I mentioned?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun