v1.12.0

Announcements

First-time contributors:

• Sebastian Guadalupe (@SebastianGuadalupe) (#1377)

Breaking changes

• We dropped support for Julia versions older than v1.0 (#1322)
• Plot recipes now use iterative refinement by default (#1303)
• Changed (increased) the default absolute zero tolerance for Floats (#1341)

Features

• Conversion of hyperrectangles to cartesian products of intervals (#1336)
• Set difference between intervals (#1330)
• Set membership for lazy translation (#1363)
• Concrete intersection between an Interval and general LazySets (#1345)
• Added PolynomialZonotope set representation (#1370)
• Concrete minkowski_sum for VPolygons (#1377)

Bug fixes

• Fix diagonal matrix times UnitVector (#1362)
• tohrep of an empty VPolytope/VPolygon now returns an EmptySet (#1371)
• The convex hull of empty VPolytope's is an empty VPolytope (#1369)
• Conversion to polyhedron now doesn't break with an empty VPolytope (#1373)

Enhancements

• Faster disjointness check for intervals (#1323)
• Added a generators getter for Zonotopes (#1313)
• Robust point-in-polygon check (#1340)
• In conversion from HPolytope to HPolygon, set the prune option such that it removes redundant constraints by default (#1342)
• We revised plot recipes defaults, letting alpha < 1 and aspectratio=1, and properly used the no-alias version of the argument names (#1304)
• Compute vertices of HPolytope in two-dimensions using the algorithm for convex polygons (#1338)
• Added _isapprox for general Reals (#1367)
• Faster concrete intersection between an Interval and a polyhedron (#1345)
• Improve binary convex hull of VPolytope, using specializations for dimensions 1 and 2 (#1369)