This is somewhat experimental still.
This (XS) module optionally exports a single function 'convex_hull' which calculates the convex hull of the input points and returns it. The algorithm is 'O(n log n)' due to having to sort the input list, but should be somewhat faster than a plain Graham's scan (also 'O(n log n)') in practice since it avoids polar coordinates.
| Package Version | Update ID | Released | Package Hub Version | Platforms | Subpackages |
|---|---|---|---|---|---|
| 0.01-bp156.3.3 info | GA Release | 2023-12-07 | 15 SP6 |
|
|
| 0.01-bp155.2.10 info | GA Release | 2023-05-17 | 15 SP5 |
|
|
| 0.01-bp154.1.21 info | GA Release | 2022-05-09 | 15 SP4 |
|
|
| 0.01-bp153.1.16 info | GA Release | 2021-03-06 | 15 SP3 |
|
|
| 0.01-bp152.3.13 info | GA Release | 2020-04-16 | 15 SP2 |
|
|
| 0.01-bp151.3.1 info | GA Release | 2019-07-17 | 15 SP1 |
|
|
| 0.01-bp151.2.14 info | GA Release | 2019-05-18 | 15 SP1 |
|
|
| 0.01-bp150.2.4 info | GA Release | 2018-07-30 | 15 |
|
|