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

Volume overapproximation using box enclosure #1806

Open
mforets opened this issue Dec 2, 2019 · 2 comments
Open

Volume overapproximation using box enclosure #1806

mforets opened this issue Dec 2, 2019 · 2 comments
Assignees
Labels
feature ➕ A new feature

Comments

@mforets
Copy link
Member

mforets commented Dec 2, 2019

Using an iterative scheme, one can overapproximate the volume of a set X by sequentially covering it with boxes (whose volume is easy to compute), discarding the subsets whose intersection with X is empty and partitioning those whose intersection is non-empty until some tolerance is reached.

@mforets
Copy link
Member Author

mforets commented Dec 3, 2019

A first step is to produce the volume for a hyperrectangular set, this is now #1811 (done).

@mforets mforets self-assigned this Dec 4, 2019
@schillic schillic added the feature ➕ A new feature label Apr 11, 2020
@mforets
Copy link
Member Author

mforets commented Jun 26, 2022

See also this comment which has two prototype implementations (one in the branch, another one in a notebook).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
feature ➕ A new feature
Projects
None yet
Development

No branches or pull requests

2 participants