What is the best way to find the pad pitch when the design has 27000+ pads? Using the (combine relation1 relation2) operator crashes my session as Ravel attempts to store 729 million+ combinations. Even if I break the design into quadrants to reduce the number of pads being looked at, Ravel still has to deal with 48 million+ combinations. Also, looking only at the pads nearest the design edge doesn't give me the result I'm looking for. I need to find the minimum pad pitch in the design.
Do you have any suggestions?
I have attempted to implement your suggestion and got as close as I could to a working solution by subdividing the design into smaller "regions" to work with. Simply combining 27K+ pads in order to do a selection of pad pairs below the cutoff distance crashes my session. Subdividing the design into regions allowed me to combine a smaller subset of pads that met the cutoff distance. However, because the design has 27K+ pads, I still run into a memory issue because even though the regions make pad pairs much more manageable, Ravel must still keep track of 70+ of these "region" tuples.
How would you implement your suggestion? How do I create an initial tuple of pad pairs to even look at whether or not they meet a certain cutoff distance? I understand your theory and what you are suggesting. I just don't know how to implement it. I can't do (combine bumppad bumppad) or the session will run out of memory. So how do I begin?
Thanks for your help!!