Timeline for Inter-Kissing Number for Non-Spheres
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 15, 2017 at 6:06 | history | suggested | CommunityBot | CC BY-SA 3.0 |
Fixed OP's link to already-bumped question.
|
| Nov 15, 2017 at 2:41 | review | Suggested edits | |||
| S Nov 15, 2017 at 6:06 | |||||
| Sep 2, 2012 at 18:05 | vote | accept | bobuhito | ||
| Sep 2, 2012 at 17:51 | comment | added | bobuhito | @Gerhard, Good answer; it seems the 3rd D lets you "go around" and touch anything...I'll need to focus on convex shapes as everyone has pointed out. | |
| Sep 2, 2012 at 16:49 | comment | added | Gerhard Paseman | You can fuse two identical rods to form a cross shape where the main constraint on mutual contact is the initial rod length. To get the idea, line up n rods as the columns of an array and n more as the rows on top, and then fuse pairs of them together to get n mutually touching solids. For convex shapes, you can find more in work of Martin Gardner, among others. Gerhard "Ask Me About System Design" Paseman, 2012.09.02 | |
| Sep 2, 2012 at 8:53 | answer | added | Douglas Zare | timeline score: 11 | |
| Sep 2, 2012 at 8:48 | comment | added | zeb | I feel like you can achieve arbitrarily large inter-kissing numbers by carefully arranging a large number of interlocked octopen with nearly one-dimensional legs... If so, this problem is probably more interesting if we restrict to convex shapes. | |
| Sep 2, 2012 at 7:33 | history | asked | bobuhito | CC BY-SA 3.0 |