Let S = { trigon, tetragon , pentagon , ... ,... } is a set of polygons How to calculate intersection of subsets of (every element actually) Powerset(S) Powerset(S) =[ {} , {trigon} , {tetragon} , {pentagon} , {trigon, tetragon} , {trigon,pentagon} ,......] for i in Powerset(S) find intersect(i…

Find the intersection of elements of powerset one by one

XLVII December 8, 2021, 3:00pm 3

Can you say something about time complexity?

Topic		Replies	Views
True power set of a set is slower than power array of array Performance	3	761	April 17, 2021
Intersect() is slow for large arrays General Usage	5	3132	November 21, 2016
Intersection of level sets Performance question , performance	12	686	June 6, 2024
Zero allocated iterator for powersets Performance question	0	182	February 21, 2024
Minimizing allocations for custom powerset iterator Performance question , memory-allocation , iterators	7	562	April 14, 2022