Algorithms for TW
Project description
TW Complex
Repo with algorithms to divide ally villages into front and back in TW.
Underneath it is a problem of dividing a set of 2D points A according to the min_radius and max_radius distances from a set of other 2D points B, which can be solved most simply by counting the distances from each point in the first set A to all points in the second set B one by one.
Examples (before -> after)
Example 1
Ally: 10000 points
Enemy: 15000 points
min_radius: 1.4
max_radius: 2
Example 2
Ally: 2500 points
Enemy: 6000 points
min_radius: 4
max_radius: 10
Example 3
Ally: 20000 points
Enemy: 20000 points
min_radius: 20
max_radius: 60
Example 4
Ally: 20000 points
Enemy: 20000 points
min_radius: 10
max_radius: 120
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
tw-complex-0.1.0.tar.gz
(4.1 kB
view hashes)
Built Distribution
Close
Hashes for tw_complex-0.1.0-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | fe9180319f3c587142f26d3e38ea02b47d0b802990f69384742b38ef3bb0f9a6 |
|
| MD5 | bbf028777436d9fd2d7520fc95fc81ab |
|
| BLAKE2b-256 | 1681d73e813f74a435b0e0f8f8c3ec39d2b60cca78bdcc5b7411362b9d6353d3 |
