Timeline for Delauney triangulation in high (>20) dimensions
Current License: CC BY-SA 3.0
5 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/
|
|
| Oct 28, 2012 at 1:15 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 2 characters in body
|
| Oct 27, 2012 at 17:06 | comment | added | Joseph O'Rourke | @unknown: Sorry to misinterpret your question. Nevertheless, the algorithms still apply, with one step (in-hull check) removed. | |
| Oct 27, 2012 at 16:58 | comment | added | user27592 | Slight clarification needed. I don't have any points to begin with (i.e. n=0). What I'm going for is an algorithm that basically randomly (or otherwise) selects ANY point in d dimensional space not already in the simplex it created and then just outputs the facets - there's no need to check if the new point is inside the convex hull (by construction) so I'm not looking for an incremental algorithm. I'm basically looking for a space-filling algorithm that generates simplexes that satisfy the Delauney condition in high dimension. | |
| Oct 27, 2012 at 16:12 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |