combining many polytopes into single polytope about polytope HOT 4 CLOSED

Hi Muthu. I am not sure what you mean by "combine". Is this a mathematical operation like union, convex hull, minkovski sum? In our package, "+" is used for polytope unions and in general union of two polytopes is no more a polytope (i.e., polytopes are not closed under union operation). Therefore, union operation generally returns a region.

from polytope.

Hi necozay,
Thank you for your comment. by the word combine I meant to form a new closed polytope by the union of two polytopes.

assume a region with many polytopes (all are convex) and some of them intersect with each other. so I can reduce the length of the region [ i.e. reducing the number of polytopes within the region] as follows

1. find the polytopes which are intersecting
2. make a single polytope from above intersecting polytopes
3. replace intersecting polytopes with the single polytope from Step 2

now the region should have less number of polytopes.
In my project, the reduction of the length of the region helps to make a solid conclusion about the possible solution space for the given problem

your further suggestions would be greatly appreciated

Thank you

Best regards,
Muthu Vallinayagam
Researcher, Inst. of Experimental physics
TU Freiberg, Germany

from polytope.

A similar functionality exists inside union. You can try: r = pc.union(p1, p2, True) instead of the + operator.
Please see: #82 (comment) for more details.

from polytope.

thank you for your comments. I have already seen the referred discussion. But still, I have an issue with this method.
let me explain what I do. I have a Region containing three polytopes as shown in the following plot.

the red polytope is in contact with two other polytopes. So in our problem, we define these three polytopes as possible solutions. In the end, we want to combine them and create a single polytope. The H representation of these polytopes are

0 Single polytope ( blue polytope )
[[ 0.57735 0.57735 0.57735] | [[ 0.27189]
[-0.57735 0.57735 -0.57735] | [-0.11722]
[ 0.57735 -0.57735 -0.57735] x <= [ 0.01637]
[-0.57735 -0.57735 -0.57735] | [-0.26141]
[ 0. 1. 0. ] | [ 0.125 ]
[-0.57735 -0.57735 0.57735]]| [-0.15292]]

1 Single polytope ( red polytope )
[[ 0.57735 0.57735 0.57735] | [[ 0.27466]
[ 0.57735 -0.57735 0.57735] | [ 0.12755]
[ 1. 0. 0. ] | [ 0.25 ]
[ 0.57735 -0.57735 -0.57735] | [ 0.01637]
[-0.57735 0.57735 0.57735] x <= [-0.00429]
[-0.57735 0.57735 -0.57735] | [-0.11707]
[-0. -1. -0. ] | [-0.125 ]
[-0.57735 -0.57735 0.57735] | [-0.15292]
[ 0.57735 0.57735 -0.57735]]| [ 0.16319]]

2 Single polytope ( green polytope )
[[-0.57735 0.57735 0.57735] | [[-0.01401]
[ 0.57735 -0.57735 -0.57735] | [ 0.01637]
[ 0.57735 0.57735 0.57735] x <= [ 0.27958]
[-0.57735 -0.57735 0.57735] | [-0.16113]
[-1. -0. -0. ] | [-0.25 ]
[ 0.57735 0.57735 -0.57735]] | [ 0.16319]]

I tried to combine the first two polytops as >r = pc.union(p1, p2, True).
I expected that "r" would be a single polytope. but it is a Region again, the screen shot of execution is here.

just curious to know why the union is not able to combine given polytopes and return Region.

thank you

from polytope.