Hello Wouter, It's a 2D lattice. I've already pretty much worked it all out, and you can view the results on my web page, here: http://mrob.com/pub/math/seq-a181785.html On Sat, May 7, 2011 at 13:11, wouter meeussen <wouter.meeussen@pandora.be>wrote:
Robert,
2D or 3D lattice?
Wouter
----- Original Message ----- From: "Robert Munafo" <mrob27@gmail.com> To: "math-fun" <math-fun@mailman.xmission.com> Sent: Saturday, May 07, 2011 6:35 PM Subject: Re: [math-fun] Convex polyominoes
My program is correctly generating the polyominoes (verified by comparing counts to A000105), but I'm stuck (in my mind) on how to derive the convex hull and how to test other points in the grid to see of they are inside or outside the convex hull. Once I know which points define the vertices of the convex hull, I could use the Jordan Curve theorem for testing other points, but when a point falls right on the boundary I have to worry about round-off error.
Any hints?
-- Robert Munafo -- mrob.com Follow me at: fb.com/mrob27 - twitter.com/mrob_27 - mrob27.wordpress.com- youtube.com/user/mrob143 - rilybot.blogspot.com