Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

The performance issues of interval calculations in large quantities. #91

Closed
hubuxiaohe opened this issue Mar 7, 2024 · 1 comment
Closed
Labels
question Issue is a question

Comments

@hubuxiaohe
Copy link

In my analysis, there may be a large number of intervals involved. When I traverse a large number of intervals to determine if they overlap with other intervals, the time complexity is O(n^2). However, if interval trees are used for overlap detection, the complexity becomes O(nlogn). Does the underlying principle of this module involve the use of interval trees or other suitable data structures? :)

@AlexandreDecan
Copy link
Owner

Hello,

There are several optimizations especially to handle large disjunctions of intervals. I would say: try it and see whether the performances meet your expectations or not :-)

@AlexandreDecan AlexandreDecan added the question Issue is a question label Mar 7, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
question Issue is a question
Projects
None yet
Development

No branches or pull requests

2 participants