Timeline for Sequentially/parallel algorithm for extracting blob outer perimeter/contour length
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2014 at 16:56 | vote | accept | NordCoder | ||
| Sep 27, 2014 at 7:21 | comment | added | rwong | To formally prove whether a contour tracing algorithm is sound, (in my opinion) one will have to map the algorithm to its "crack codes" equivalent (where the "contour" travels along the horizontal or vertical "cracks" between two pixels that share the crack). The "crack codes" define a non-empty boundary set and interior set, and connectivity is also defined. For a singly-connected region, "crack codes" do not visit the same crack twice, although vertices can be visited multiple times. This information is just for proving algorithms, not for implementation advice. | |
| Sep 27, 2014 at 6:10 | answer | added | rwong | timeline score: 2 | |
| Jul 28, 2014 at 23:32 | answer | added | JBRWilkinson | timeline score: 0 | |
| Jul 28, 2014 at 16:15 | history | migrated | from stackoverflow.com (revisions) | ||
| Jul 28, 2014 at 13:00 | history | asked | NordCoder | CC BY-SA 3.0 |