Timeline for Are there any algorithms for solid polygon clustering?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2022 at 23:57 | history | edited | NtsDK | CC BY-SA 4.0 |
Added link to the sources.
|
| Oct 13, 2019 at 21:55 | comment | added | NtsDK | I added more information about complexity and interesting points (including bottleneck situation) | |
| Oct 12, 2019 at 1:50 | history | edited | NtsDK | CC BY-SA 4.0 |
Added more information about solution.
|
| Oct 11, 2019 at 11:08 | comment | added | Valentas | I mean adding it to the answer. | |
| Oct 11, 2019 at 11:05 | comment | added | NtsDK | @Valentas do you mean add illustration to the question or to the wiki? I don't understand. | |
| Oct 11, 2019 at 6:54 | comment | added | Valentas | Very nice. Never thought about this simple continuous version of K-means. It has a scientific name: en.wikipedia.org/wiki/Centroidal_Voronoi_tessellation. If you have time, please add one of the illustrations, e.g., about the points migrating through a bottleneck here. | |
| Oct 10, 2019 at 23:54 | vote | accept | NtsDK | ||
| Oct 10, 2019 at 23:54 | history | answered | NtsDK | CC BY-SA 4.0 |