Timeline for Computer program for polyhedral manifolds
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2023 at 22:17 | vote | accept | mrburch | ||
| Aug 25, 2023 at 21:58 | comment | added | mrburch | @RyanBudney I think this is what I’ll end up doing. I just wanted to check if anyone had made a program already. | |
| Aug 25, 2023 at 20:28 | comment | added | Ryan Budney | I think if you look around the Regina source code, you can find the python script to generate all the 3-manifold (triangulations) you get by gluing opposite faces of a dodecahedron. That code could be readily adapted to essentially any convex polyhedron gluing. It is ?likely? in the census code, but it might be in the utilities. | |
| Aug 25, 2023 at 20:17 | comment | added | Ryan Budney | You could write a python script to generate the triangulation from the polyhedron identifications, then feed it to Snappy or Regina. I think that's how several of the triangulations in Regina were generated -- for example, the Seifert-Weber dodecahedral space. If your polyhedron is convex then the algorithm would be pretty straightforward: subdivide the faces then cone off in the polyhedron. | |
| Aug 25, 2023 at 20:12 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title
|
| Aug 25, 2023 at 19:56 | answer | added | Sam Nead | timeline score: 2 | |
| Aug 25, 2023 at 19:46 | history | asked | mrburch | CC BY-SA 4.0 |