i have list of lists each list contains edge lengths of polygon. example: [[0, 1, 2], [0, 1.1, 2], [0, 1.2, 2], [0, 1.3, 2], [4.5, 1.1], [4.4, 1.1], [5, 1, 2], [5, 1.1, 2], [5, 1.2, 2] [6, 1, 7, 4], [6, 1.1, 7, 4.1]] i able find approx minimum "cover" in sense each element of "cover" of it's values within specified tolerance of elements covering. example, if tolerance .1 given list above get: [[0, 1, 2], [0, 1.2, 2], [4, 1], [4.5, 1.1], [5, 1.1, 2], [6, 1, 7, 4],] i new python use of terminology isn't far off. perhaps helpful explain motivation.i architect trying optimize given surface panelization. because of manufacturing tolerances panels edges lengths differ fixed amount can considered same(in example above edges can differ .1 , still considered same). trying find minimum set of panels produced , still panelize surface. to find optimal solution here computationally quite difficult -- seem asking something, doesn't ...