I thought about it, came up with one of the n log(n) algorithms, but now don't feel obliged to type it up. :-)
Cheers,
Ben
Mininum Convex Polygon around Points?
- (JayMehaffey)
- (16)
- Oct. 5, 2004, 01:57:46 PM EDT
Are they always convex?
- (FuManChu)
- (7)
- Oct. 5, 2004, 02:19:00 PM EDT
Convex Hull
- (JayMehaffey)
- (6)
- Oct. 5, 2004, 02:55:00 PM EDT
Glad you said you found it
- (ben_tilly)
- Oct. 5, 2004, 06:20:11 PM EDT
You need an algorithms book.
- (static)
- (4)
- Oct. 5, 2004, 11:42:53 PM EDT
NIST DADS
- (ChrisR)
- Oct. 5, 2004, 11:53:02 PM EDT
I have that one
- (JayMehaffey)
- (2)
- Oct. 6, 2004, 12:31:33 AM EDT
Wierd
- (altmann)
- (1)
- Oct. 6, 2004, 01:05:42 AM EDT
I have the C++ one, too.
- (static)
- Oct. 6, 2004, 01:46:21 AM EDT
Start with center of mass
- (drewk)
- Oct. 5, 2004, 02:45:15 PM EDT
Re: Mininum Convex Polygon around Points?
- (deSitter)
- (6)
- Oct. 5, 2004, 11:56:47 PM EDT
Yep, that would be a formal statement
- (JayMehaffey)
- (5)
- Oct. 6, 2004, 12:38:55 AM EDT
Re: Yep, that would be a formal statement
- (deSitter)
- (2)
- Oct. 6, 2004, 08:48:25 AM EDT
If he doesn't remember highschool math...
- (ben_tilly)
- (1)
- Oct. 6, 2004, 11:53:16 AM EDT
He's Jay - he'll figure it out
-NT
- (deSitter)
- Oct. 6, 2004, 01:06:37 PM EDT
You don't need to compute angles
- (ben_tilly)
- (1)
- Oct. 6, 2004, 11:47:53 AM EDT
Actually ended up using vector math
- (JayMehaffey)
- Oct. 6, 2004, 12:02:29 PM EDT