JuliaReach/LazySets.jl: v2.7.4

Diff since v2.7.3

Closed issues:

• Union-splitting in concrete intersection of hyperrectangles (#533)
• Clustering function (#584)
• Specialized support function computations (#600)
• Follow up lazy intersection polytope vs polytope (#689)
• Lazy Overapproximation operation (#707)
• Default is_intersection_empty between lazyset and abstract polytope (#724)
• Remove redundant constraints when using template directions (#757)
• Generation of arrays of random sets (#899)
• Memory use of parallel box overapproximation (#987)
• Add concrete and abstract traits (#991)
• Simplify overapproximations API (#1020)
• Add benchmarks for linear map (#1084)
• Constraints list should return a copy (#1118)
• Use MathOptInterface (#1493)
• Inconsistent point in tetrahedron check (#3303)

Merged pull requests:

• support function for SPZ (#3073) (@lucaferranti)
• Add sample method for DensePolynomialZonotope (#3268) (@schillic)
• Fix warnings raised by linter (#3273) (@schillic)
• Faster brute-force search in support-vector computation of VPolygon (#3277) (@schillic)
• Add dependabot (#3285) (@schillic)
• Bump actions/checkout from 2 to 3 (#3286) (@dependabot[bot])
• Bump codecov/codecov-action from 2 to 3 (#3287) (@dependabot[bot])
• Also run CompatHelper in test folder (#3288) (@schillic)
• Add invalidations CI script (#3290) (@schillic)
• Outsource solver code to separate file (#3292) (@schillic)
• Update README and scripts (#3294) (@schillic)
• Change normalize to resolve ambiguities in v1.9 (#3298) (@schillic)
• Generalize check if point is in hyperplane (#3304) (@mforets)