Timeline for Passing C through a slot
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2022 at 13:05 | history | edited | Joseph O'Rourke | CC BY-SA 4.0 |
added 19 characters in body
|
| Apr 24, 2022 at 11:01 | history | edited | Glorfindel | CC BY-SA 4.0 |
broken link fixed
|
| Aug 10, 2017 at 10:34 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Broken link fixed.
|
| Sep 18, 2013 at 16:43 | vote | accept | ARi | ||
| Sep 16, 2013 at 11:31 | comment | added | Joseph O'Rourke | @ARi: Not that I know of. It would be difficult to measure the complexity for smooth curves. I guess it would have to be in terms of the degree of an algebraic curve and the bit-size of the coefficients. | |
| Sep 16, 2013 at 10:50 | comment | added | ARi | Thanks. Is their any information on non-polygonal curves in respect of the time complexity in calculating their door width. | |
| Sep 14, 2013 at 0:35 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Cite Yap's upper bound. And algorithm sketch.
|
| Sep 14, 2013 at 0:24 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |