Subject:
|
Re: On the recursive subdivision of two-dimensional food items
|
Newsgroups:
|
lugnet.off-topic.geek
|
Date:
|
Mon, 16 Aug 2004 15:45:11 GMT
|
Viewed:
|
1024 times
|
| |
| |
On 02:13 16-08-04, Todd Lehman wrote
> Last night at IHOP, after copious amounts of beer at Rocklands, a few of
> us were
> talking about how we cut our food up into differently-sized portions
> during the
> eating process, and I realized that an algorithm exists for maximizing the
> total
> enjoyment of a given serving of food...
<MUCH GEEKAGE SNIPPED>
> glasses because subdividing a body of liquid is not only time consuming
> but messy. This algorithm lends itself well to two-dimensional food items
> cut with the side of a fork because you are making cuts there anyway.
Me thinks someone was over thinking this a bit too much....
excellent geek analysis...
Note that this algorithm doesn't apply well to liquids in bottles or
|
|
Message has 2 Replies:
Message is in Reply To:
14 Messages in This Thread:
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|