v1.26.0

Announcements

Contributors for this release:

• Marcelo Forets (@mforets)
• Christian Schilling (@schillic)

Breaking changes

• Rename CacheMinkowskiSum to CachedMinkowskiSumArray (#1891)

Enhancements

• Add conversion from M-sum of M-sum array to M-sum array (#1893)
• Add a parameter in iterative refinement structs (LocalApproximation, PolygonalApproximation) (#1892)

Internal changes

• Revision of Ball1 (#1894)
• Remove output-type annotations (#1897)

v1.25.0

Announcements

Contributors for this release:

• Daniel Freire (@dfcaporale)
• Marcelo Forets (@mforets)
• Christian Schilling (@schillic)

Features

• Added the function isconvextype to check if a given set type is guaranteed to be convex (#1834)
• Special cases for isconvextype of the set complement (#1847)
• Add element type function (eltype) for any set type (#1863)

Enhancements

• Faster support vector for hyperrectangular sets if the direction is a single entry vector (#1850)
• Fallback implementation of overapproximate with an HPolytope, and better error messages (#1854)
• Methods for lazy convex hull array of singletons (#1852)
• Update documentation of iterative refinement overapproximation (#1861)
• Efficient convert methods for identity (#1864)
• Improved docs for an_element of a LazySet (#1869)
• Add an_element function for Polyhedron (#1868)
• Use SingleEntryVector in an_element function (#1888)

Bug-fixes

• Various fixes in isconvextype (#1860)
• Fixed vertices_list of Zonotope without generators (#1882)

Internal changes

• Move CartesianProductArray, ConvexHullArray, MinkowskiSumArray, UnionSetArray and IntersectionArray to their own files (#1865, #1883, #1890)
• Move reflect() to LazySet.jl (#1873)
• Upgrade to using Julia v1.3 in docs builds (#1877)

v1.24.0

Announcements

First time contributor:

• Daniel Freire (@dfcaporale)

Contributors for this release:

• Marcelo Forets (@mforets)
• Daniel Freire (@dfcaporale)
• Christian Schilling (@schillic)
• Ueli Wechsler (@ueliwechsler)

Features

• Membership check for lazy M-sum of abstract singleton and set (#1795)
• Conversion of lazy convex hull of singletons to VPolytope (#1817)
• Robust equivalence check for sets, using double inclusion (#1819)
• Volume function for hyperrectangular sets (#1812)
• Volume function for the ball in the 2-norm (#1829)
• Concrete minkowski sum with singleton (#1831)
• isuniversal methods for all remaining sets (#1799)

Enhancements

• The inclusion check of a polytopic set P and a set S now uses the constraints lists of S as default, and support function evaluation of P, if possible; otherwise uses the vertices list of P as before. A new algorithm keyword allows to choose which method to use. (#1796)
• Membership function for a Ball2 now uses Tolerance (#1825)
• Faster hyperrectangle support function for a vector with a single component (#1785)
• Concretely type linear constraint arrays in internal usage (#1803)
• Update some manual examples with respect to the refinement argument (#1830)
• Robust getfield comparison (#1824)
• We now print an informative error message if a required external package is missing (#1808)

Bug-fixes

• Inclusion check between hyperrectangular set is now robust (#1810)
• Fix order 0 for taylor model to zonotope conversion (#1820)
• Add missing function for approximate permutation check (#1833)

v1.23.0

Announcements

This release is compatible with the current stable Julia v1.2 and the upcoming Julia v1.3.

Features

• Set difference between axis-aligned boxes (#1790)

v1.22.0

v1.22.0 (2019-10-28)

Diff since v1.21.0

Announcements

This release is compatible with the current stable Julia v1.2 and the upcoming Julia v1.3.
Upper bounds have been added to all dependencies (#1782), as required by the new automatic merging mechanism for the General registry.

Breaking changes

• changed interface of linear_map for polyhedra: option use_inv is now part of the more general option algorithm (#1713) and the default algorithm is chosen consistently (in particular we check for full row rank for "division" algorithm) (#1777)

Features

• added chebyshev_center function for polyhedra and Ball2 (#1696)
• added lazy Bloating operation (#1778)

Enhancements

• added options to linear_map for 1) using the constraint representation without invertibility check, 2) using the vertex representation for invertible matrices, and 3) passing the inverse matrix directly (#1713)
• overload overapproximate for the reduction of the order of a zonotope (#1766)

Bug-fixes

• fixed division by zero in constraints_list of Zonotopes (#1773)
• fixed constraints_list of Zonotopes with sparse generator matrix (#1774)

v1.21.0

Announcements

This release is compatible with the new Julia version 1.2 and the upcoming Julia version 1.3.
Continuous integration under Windows has been added (#1739).

First-time contributors:

• @tacuaaa

Breaking changes

• allow AbstractVectors in Hyperrectangle fields (#1717)
• apply a convex-hull algorithm (which removes duplicates) when computing the vertices_list of an HPolygon by default (#1719)

Features

• added functions to (de)activate assertions (#1732)
• added isoperation and isoperationtype functions (#1734)
• added conversion between LazySets.Interval and IntervalArithmetic.Interval (#1764)

Enhancements

• faster method for isdisjoint(::CartesianProductArray, ::HalfSpace) (#1730)
• made box_approximation and ballinf_approximation aliases of overapproximate (#1716)
• added option to compute support function for lazy Intersection containing a polyhedron with the (imprecise but cheap) fallback implementation (#1749)
• inner constructor check in SparseMatrixExp (#1743)
• faster support function/vector for CartesianProductArray and sparse direction vector (#1735)
• conversion from IntervalArithmetic.IntervalBox to LazySets.Hyperrectangle now preserves the representation of intervals as static arrays (#1763)
• various documentation improvements (#1762, #1750)

Bug-fixes

• remove duplicate vertex when applying convex_hull to a set or list consisting of a single point (#1718)
• fixed constrained_dimensions of a polyhedron without constraints (#1752)
• fixed concrete intersection of a CartesianProductArray and a polyhedron without constraints (#1754)

v1.20.0

Announcements

This release is compatible with the new Julia version 1.2 and the upcoming Julia version 1.3.

Breaking changes

• upgrade JuMP to v0.20 (#1668)

Features

• added concrete affine_map operation (#1692)
• added concrete reflect operation (#1689)
• added concrete is_interior_point function for error-tolerant membership checks (#1690)

Enhancements

• fixed compatibility for Julia v1.2 (#1675)
• allow creation of Polyhedra backend with arbitrary numeric type (#1710)

Bug-fixes

• fixed plotting of empty polyhedra (#1706)

v1.19.0

Breaking changes

• downgraded dependency Distributions.jl due to upstream incompatibilities (#1665)

Features

• rejection sampling for an arbitrary LazySet (#1612)
• overapproximation of ResetMap by CartesianProductArray (#1677)

Enhancements

• revised lazy-map constructors (#1627)
• added a dimensional check in the zonotope constructor (#1664)
• (internal:) changed the directory structure of the package by adding more subdirectories; this change does not affect the programmatic behavior, but (hopefully) simplifies the navigation for developers (#1656)
• generalized overapproximation methods for Zonotopes to AbstractZonotope (#1681)

Bug-fixes

• fixed a 4-point convex-hull special case when the points are aligned (#1673)

v1.18.1

Enhancements

• generalized Zonotope methods to AbstractZonotope (#1635)

Bug-fixes

• fixed compilation problems on Windows due to type parameters (#1640)

v1.18.0

Features

• added hausdorff_distance function to compute the Hausdorff distance between two sets (#1538)
• added alternative Zonotope overapproximation of the convex hull of two zonotopes (#1397)
• added concrete intersection between CartesianProductArray and AbstractPolyhedron (#1608)
• added concrete convex_hull of polytopic sets (#1637)
• added implementing_sets function to obtain the list of LazySet types that implement a set operation (#1616)
• added concrete linear_map for polyhedral CartesianProducts and CartesianProductArrays (#1618)

Bug-fixes

• fixed ambiguities for lazy Intersection of polyhedra (#1354)
• fixed set membership test for VPolytope (#1646)