Timeline for Transform a lattice polygon to minimum diameter by shearing
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2023 at 16:51 | vote | accept | Hugo Pfoertner | ||
| Nov 25, 2022 at 15:18 | answer | added | Kirill L. | timeline score: 1 | |
| Nov 24, 2022 at 17:01 | answer | added | Hugo Pfoertner | timeline score: 2 | |
| Nov 22, 2022 at 14:04 | comment | added | Hugo Pfoertner | @jdt Although that would of course also be very interesting, it is then a completely different and, in general, much more difficult task. This would then read something like this: only the number of vertices and the area would be given and one or more polygons with these properties would have to be determined. Specifying the polygon coordinates of the start polygon would then be superfluous. The task would be similar to codegolf.stackexchange.com/questions/253633/… . So here only polygons that can be generated by shearing are valid. | |
| Nov 22, 2022 at 13:52 | comment | added | Hugo Pfoertner | @JonathanAllan The fact that I would also like to see the squared diameter in the result is roughly equivalent to wanting to see the final amount on a restaurant bill. Although the guest can calculate it himself, he would still find a bill without the sum strange. So that's part of the job here. | |
| Nov 22, 2022 at 13:50 | comment | added | Hugo Pfoertner | @JonathanAllan I fully understand that there are languages in which a formatted output is impossible or at least disproportionately expensive. Assembler comes to mind immediately. Of course, I don't want to exclude them from participating because of that. But if a language can easily produce formatted output, then I take the liberty of specifying a format that I can handle on trial without conversion. | |
| Nov 22, 2022 at 13:48 | history | edited | Hugo Pfoertner | CC BY-SA 4.0 |
Clarification that it is not mandatory to specify a framework program.
|
| Nov 20, 2022 at 15:11 | comment | added | jdt | Do we have to shear the points or can we use other methods as long as the area and number of points (all integers) remain the same? | |
| Nov 20, 2022 at 12:37 | comment | added | Jonathan Allan | I see that you want us to do our golf AND provide a program that wraps our golf. I don't think you should do that. | |
| Nov 20, 2022 at 12:33 | comment | added | Jonathan Allan | Also, why are we required to output the square - that seems like unnecessary fluff. | |
| Nov 20, 2022 at 12:26 | comment | added | Jonathan Allan | I suggest removing this strict output formatting "in this format. The commas between x and y and between \$),(\$ are mandatory" as it is not core to the challenge. | |
| Nov 20, 2022 at 6:00 | history | tweeted | twitter.com/StackCodeGolf/status/1594208920826187782 | ||
| Nov 20, 2022 at 4:22 | comment | added | Hugo Pfoertner | Yes, points on the perimeter of the polygon. See, e.g., cgm.cs.mcgill.ca/~athens/cs507/Projects/2000/MS/diameter/… . | |
| Nov 19, 2022 at 23:11 | comment | added | Luis Mendo | To clarify: when you say the largest Euclidean distance between any two points on the circumference of the polygon, do you mean on the permiter of the polygon? | |
| Nov 19, 2022 at 10:45 | history | asked | Hugo Pfoertner | CC BY-SA 4.0 |