S2Polygon InitToCellUnionBorder performance
Open
- Dominant language
- C++
- Stars
- 2.7k
- Forks
- 357
- Avg merge
- 11h 4m
- Merged PRs (30d)
- 1
Description
Used an old version of S2 (cloned several years ago) and moved now to the latest v0.12.0 tag. All good, besides the performance of S2Polygon::InitToCellUnionBorder which is much slower than what it used to be. Especially noticeable for large complex polygons.
Is this a known issue? Is there a way to optimize the function? Is there an alternative faster way to create a polygon from a list of cell ids?
Contributor guide
Assessment
This issue has not been assessed yet.