Timeline for Number of neigbour Voronoi cells for a random set of points on S^k or cube [-1, 1]^k?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 4, 2012 at 20:54 | comment | added | Ori Gurel-Gurevich | In closely related Poisson-Voronoi tessellation, the degree grows exponentially with the dimension (I believe it is roughly $2^k$ up to lower order multiplicative terms, but I can't find a reference now). So the relevant condition seems to be whether $N$ is bigger then this. For your example parameters, I would expect most pairs of points to be adjacent. | |
| Jul 4, 2012 at 20:48 | history | edited | Ori Gurel-Gurevich | CC BY-SA 3.0 |
tags and typos
|
| Jul 4, 2012 at 19:28 | answer | added | Igor Rivin | timeline score: 4 | |
| Jul 4, 2012 at 10:04 | answer | added | Benoît Kloeckner | timeline score: 4 | |
| Jul 4, 2012 at 6:15 | history | asked | Alexander Chervov | CC BY-SA 3.0 |