Timeline for Sampling from a partition of a hypercube by convex polytopes.
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2011 at 5:21 | history | edited | djv | CC BY-SA 3.0 |
added 148 characters in body
|
| Sep 20, 2011 at 5:20 | comment | added | djv | Yes, the tree is being used to do a variable resolution discretisation of the hypercube - so "important" areas have significantly more (and hence smaller) polytopes. Off the top of my head, the maximum volume ratio between the largest and smallest polytopes could be anywhere between $2^{10}$ or $2^{20}$. What you suggest seems fairly simple to implement, so I'll give it a try and see if it works alright. Thanks! | |
| Sep 20, 2011 at 5:12 | comment | added | Keenan Pepper | Can't you just sample points uniformly from the entire hypercube, discarding points in polytopes which already have enough points? The only reason this would be inefficient is if your polytopes have widely differing (hyper)volumes. Do they? | |
| Sep 20, 2011 at 4:35 | history | asked | djv | CC BY-SA 3.0 |