IWETHEY v. 0.3.0 | TODO
1,095 registered users | 0 active users | 0 LpH | Statistics
Login | Create New User
IWETHEY Banner

Welcome to IWETHEY!

IWETHEY Home / IWETHEY Board / Theory and Practice of Programming Forum / You need an algorithms book.
Post #177,939
by static
10/5/04 11:42:53 PM
Reply
New You need an algorithms book.
Like [link|http://www.amazon.com/exec/obidos/ASIN/0201314525/qid=1097033373/sr=2-1/ref=pd_ka_2_1/102-1952750-3300121|this one].

Wade.


Is it enough to love
Is it enough to breathe
Somebody rip my heart out
And leave me here to bleed
 
Is it enough to die
Somebody save my life
I'd rather be Anything but Ordinary
Please

-- "Anything but Ordinary" by Avril Lavigne.
Post #177,942
by ChrisR
10/5/04 11:53:02 PM
Reply
New NIST DADS
The [link|http://www.nist.gov/dads/|NIST] page lists the [link|http://www.nist.gov/dads/HTML/optimalPolygonTriangProb.html|optimal polygon triangulation problem] but it unfortunately has no current definition.
Post #177,950
by JayMehaffey
10/6/04 12:31:33 AM
Reply
New I have that one
Buried somewhere under the pile of stuff from moving. But I've read it more then once, and I don't think it address this specific question anyway.

Jay
Post #177,953
by altmann
10/6/04 1:05:42 AM
Reply
New Wierd
There is a chapter on Convex Hulls in my copy of the C++ version: [link|http://www.amazon.com/exec/obidos/tg/detail/-/0201510596/qid=1097038850/sr=1-6/ref=sr_1_6/102-2463306-3277769?v=glance&s=books|http://www.amazon.co...?v=glance&s=books] but it looks like he's expanded the book into 5 volumes for later editions and left some older content out.
--
Chris Altmann
Post #177,955
by static
10/6/04 1:46:21 AM
Reply
New I have the C++ one, too.
And I remember the chapter on Convex Hulls. That's why I recommended it.

Wade.

Is it enough to love
Is it enough to breathe
Somebody rip my heart out
And leave me here to bleed
 
Is it enough to die
Somebody save my life
I'd rather be Anything but Ordinary
Please

-- "Anything but Ordinary" by Avril Lavigne.
     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

"Your server tonight will be: Jim." DAMMIT!
57 ms