Timeline for Triangulations of special polyhedra
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 2, 2017 at 7:07 | vote | accept | Corey Harris | ||
Feb 19, 2015 at 9:23 | history | edited | Francisco Santos | CC BY-SA 3.0 |
added 1946 characters in body
|
Feb 19, 2015 at 9:06 | comment | added | Francisco Santos | Hm, I think I am going to edit my original answer... | |
Feb 18, 2015 at 1:16 | comment | added | Corey Harris | There is actually some more structure in my problem. The points are "reduced" in a certain sense, so that if they are written as the columns of an $n \times n$ matrix, each row must have a zero. As well, the determinant of this matrix must be $d$ (same $d$ as in the question above). Does this help? | |
Feb 17, 2015 at 20:01 | history | answered | Francisco Santos | CC BY-SA 3.0 |