Timeline for Determining the simplices in freudenthal triangulation
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2012 at 23:45 | comment | added | user27396 | Please see the new text with a brief explanation | |
| Oct 23, 2012 at 23:44 | history | edited | user27396 | CC BY-SA 3.0 |
Added an explanation of freudenthal triangulation
|
| Oct 23, 2012 at 6:10 | comment | added | user27396 | You are right. Sorry for the mistake. | |
| Oct 23, 2012 at 6:09 | history | edited | user27396 | CC BY-SA 3.0 |
The example was wrongly presented
|
| Oct 23, 2012 at 4:20 | comment | added | Patricia Hersh | Aren't v1,v2,v5 colinear? Do you mean instead (v1,v5,v6), (v2,v4,v5),(v3,v4,v6) and (v4,v5,v6)? It seems like there are 4 different triangulations with this set of vertices, of which this is one. | |
| Oct 22, 2012 at 22:55 | comment | added | user27396 | I also added an example. | |
| Oct 22, 2012 at 22:55 | history | edited | user27396 | CC BY-SA 3.0 |
added 729 characters in body
|
| Oct 22, 2012 at 22:49 | comment | added | user27396 | I am sorry it should be Freudenthal Triangulation. A good discussion on Freudenthal triangulation is given in the paper Lovejoy, W. S. (1991). Computationally feasible bounds for partially observed Markov decision processes. Operations Research, 39(1), 162–175. Anyways, FT gives you a set of vertices (of some simplices) which partition a given simplex. My concern is how can I find out the simplices out of those vertices. | |
| Oct 22, 2012 at 22:42 | history | edited | user27396 | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Oct 22, 2012 at 22:31 | history | edited | Will Jagy |
edited tags
|
|
| Oct 22, 2012 at 22:30 | comment | added | Ryan Budney | Could you be a little more specific as to what you're talking about? A Google search on "Freudenthal Triangularization" returns this link as the only exact match. | |
| Oct 22, 2012 at 22:09 | history | asked | user27396 | CC BY-SA 3.0 |