Timeline for Convex polygon triangulation with stabbing number O(log n)
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2023 at 13:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 10, 2023 at 13:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 12, 2023 at 12:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 10, 2023 at 11:27 | answer | added | user16034 | timeline score: 1 | |
| Feb 10, 2023 at 11:17 | comment | added | user16034 | You are asked to fulfill $O(\log n)$, not $\log n$. | |
| Feb 10, 2023 at 11:07 | comment | added | user16034 | "the polygon in triangulated in O(logn)": what does that mean ?? Any triangulation takes exactly n-3 diagonals. | |
| Feb 10, 2023 at 11:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 11, 2023 at 10:52 | answer | added | Tassle | timeline score: 1 | |
| S Dec 10, 2022 at 10:20 | review | First questions | |||
| Dec 12, 2022 at 21:49 | |||||
| S Dec 10, 2022 at 10:20 | history | asked | venorb | CC BY-SA 4.0 |