Timeline for Convex triangulations
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2020 at 14:18 | comment | added | Jan Kyncl | When looking at the figure, I noticed that around a vertex of degree at most $4$, two of the consecutive angles will sum up to more than 180 degrees. So the neighbor along the edge common to those two angles will have a nonconvex union of incident triangles. | |
| Feb 22, 2020 at 12:56 | comment | added | Joseph O'Rourke | @JanKyncl: May I ask how you arrived at this interesting fact? | |
| Feb 22, 2020 at 11:25 | comment | added | Jan Kyncl | Observation: If all neighbors of an interior vertex $v$ in a convex triangulation are interior vertices, then the degree of $v$ is at least $5$. | |
| Feb 22, 2020 at 0:02 | comment | added | Joseph O'Rourke | It is an interesting question: When does a convex triangulation exist? And what is the computational complexity to decide if a set of points admits a convex triangulation? | |
| Feb 21, 2020 at 22:08 | vote | accept | Manfred Weis | ||
| Feb 21, 2020 at 21:19 | history | edited | Joseph O'Rourke | CC BY-SA 4.0 |
added 432 characters in body
|
| Feb 21, 2020 at 21:13 | history | edited | Joseph O'Rourke | CC BY-SA 4.0 |
added 432 characters in body
|
| Feb 21, 2020 at 20:54 | history | answered | Joseph O'Rourke | CC BY-SA 4.0 |