necozay
commented
1 year ago The speed will not only depend on the number of regions but also on the dimension of the space your polytopes are defined in. Since you are using plotting, I assume you mainly have 2d or 3d polytopes so maybe the dimension is not an issue.
For this intersection, since the reduce operation is called for
each polytope intersection, there are up to 16 times 54 LPs
to be solved, which might take some time.
You can change the default solver at runtime by setting the variable
default_solver in the module solvers.
To inspect which solvers were successfully installed:
from polytope import solvers
print(solvers.installed_solvers)To set the default solver to one from the above list (e.g., scipy), try:
solvers.default_solver = 'scipy'
slivingston
mvnayagam
Dear Polytope Developers and users, I am new to the polytope package. For my project, I am using the Polytope package to create polytopes and regions. I am able to create regions and plot them. In each region, I have many polytopes.
In one of the problems, I have a region(r1) with 16 polytopes and another region(r2) with 54 polytopes.
when I tried to find the intersection between these two regions, the polytope package take a very long time, even after 20 min, it did not completed and I terminated the process.
Hence I tried to import cvxopt. with
import cvxopt.glpk import cvxopt I am able to import cvxopt. But I do not know how to use it to find the intersection .
So can anyone give your comments on how to use cvxopt for set operations?
YOur answers will be more helpful
and Thanks in advance
Best regards, Muthu