Timeline for Complexity of planar scissor congruence
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2021 at 14:24 | vote | accept | Roland Bacher | ||
| Jul 27, 2015 at 19:03 | comment | added | Steven Stadnicki | @DylanThurston You're probably already aware, but the decision problem is trivial; any two simple of the same area are, of course, scissors-congruent. Computing the area takes time linear in the number of vertices and I believe that confirming simplicity is $O(n\log n)$ at worst. | |
| May 28, 2015 at 11:12 | answer | added | Igor Pak | timeline score: 2 | |
| May 7, 2015 at 8:43 | comment | added | Dylan Thurston | I'm not sure how to clarify it, but when I first read the title I thought you were asking about the computational complexity of deciding whether or not there is a scissors congruence. | |
| May 7, 2015 at 7:43 | history | asked | Roland Bacher | CC BY-SA 3.0 |