Timeline for Ellipse-detection algorithm
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2022 at 12:00 | history | tweeted | twitter.com/StackCodeReview/status/1501528235791769603 | ||
| Mar 8, 2022 at 22:57 | answer | added | AJNeufeld | timeline score: 1 | |
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot |
Commonmark migration
|
|
| Feb 5, 2017 at 20:35 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 192 characters in body
|
| Feb 1, 2017 at 12:19 | history | edited | Gykonik | CC BY-SA 3.0 |
Added an profile of the program
|
| Jan 31, 2017 at 13:26 | comment | added | Vogel612 | Welcome to Code Review! Please do not update the code in your question to incorporate feedback from answers, doing so goes against the Question + Answer style of Code Review. This is not a forum where you should keep the most updated version in your question. Please see what you may and may not do after receiving answers. | |
| Jan 31, 2017 at 13:26 | history | edited | Vogel612 | CC BY-SA 3.0 |
edited title
|
| Jan 31, 2017 at 13:25 | history | rollback | Vogel612 |
Rollback to Revision 5
|
|
| Jan 31, 2017 at 13:25 | history | edited | Vogel612 | CC BY-SA 3.0 |
merged changes
|
| Jan 31, 2017 at 13:22 | history | edited | 200_success | CC BY-SA 3.0 |
added 4130 characters in body; edited tags; edited title
|
| Jan 31, 2017 at 13:22 | history | rollback | Vogel612 |
Rollback to Revision 3
|
|
| Jan 31, 2017 at 13:17 | history | edited | Gykonik | CC BY-SA 3.0 |
added 4130 characters in body
|
| Jan 31, 2017 at 13:14 | answer | added | Heslacher | timeline score: 5 | |
| Jan 31, 2017 at 12:36 | comment | added | Gykonik | @ChatterOne I know, this one I calculated also! But I almost don't know anything about caching.. | |
| Jan 31, 2017 at 12:33 | history | edited | Gykonik | CC BY-SA 3.0 |
added 441 characters in body
|
| Jan 31, 2017 at 11:46 | answer | added | Peter Taylor | timeline score: 12 | |
| Jan 31, 2017 at 10:54 | comment | added | ChatterOne |
As already stated, you should provide a full working example but as a pointer, your "going through" a third time actually means you're doing \$O(n^3)\$ operations because of the nested fors. That's 6000^3=216000000000 operations and you have no caching for all the divisions and power operations you're doing.
|
|
| Jan 31, 2017 at 10:47 | history | edited | Graipher | CC BY-SA 3.0 |
Added link, fixed some spelling
|
| Jan 31, 2017 at 10:44 | comment | added | Gykonik | postimg.org/image/59faaui4f here you can see an example-image and the profiler think I'll do later :) | |
| Jan 31, 2017 at 10:42 | comment | added | Graipher |
The first thing you should do is run it with a profiler. Use python -m cProfile script_name.py to see where most of the time is being spent. Maybe you could also add a sample image/way to generate one?
|
|
| Jan 31, 2017 at 10:41 | review | First posts | |||
| Jan 31, 2017 at 12:07 | |||||
| Jan 31, 2017 at 10:39 | history | asked | Gykonik | CC BY-SA 3.0 |