v1.16.0
This release was prepared during JuliaReachDays1.
Announcements
- the functionality of the
Approximations
module is now exported (this adds the new package requirementReexport
) (#1567)
Breaking changes
- we now return a
Diagonal
matrix forget_A(::ResetMap)
(#1522) - added explicit requirement that
SymmetricIntervalHull
is only applied to a bounded set (#1525) - we now explicitly check that
low < high
in the corresponding
Hyperrectangle
constructor (#1520)
Features
- optional global tolerance setting for numeric comparisons (#1510)
- concrete Minkowski sum in halfspace representation (#1508)
- added lazy
AffineMap
set type (#1360) - support function for
Rectification
(#1381) - added
CustomDirections
andisbounding
methods forAbstractDirections
(#1293) - added concrete rectification for hyperrectangular sets (#1552)
- added
constraints_list
of a polyhedralMinkowskiSum
(#1569)
Enhancements
- generalized some
is_intersection_empty
methods toAbstractPolyhedron
(#1501) - added internal methods
right_turn(u, v)
andis_right_turn(O, u, v)
(#1514) - defined absorbing elements for map types (#1519)
- generalized
isdisjoint(::CPA, ::HPolyhedron)
toAbstractPolyhedron
(#1502) - declared neutral element of
UnionSet
(#1516) - asserted compactness in some support-function methods of
Intersection
and generalized toAbstractPolyhedron
(#1517) - faster intersection check between
CartesianProductArray
andAbstractHyperrectangle
(#1458) - faster support vector/function for
BallInf
(#1466) - use
LazySets._rtol
in theApproximations
module instead ofTOL
(#1554) - faster
vertices_list
forAbstractHyperrectangle
s (particularly flat ones) (#1467) - remove redundancies in zonotope's vertices list (#1550)
- generalized inclusion check of a
LazySet
in a polyhedralLazySet
(previously:LazySet
in anAbstractPolyhedron
) (#1566) - concrete
minkowski_sum
of twoAbstractHyperrectangle
s now returns aHyperrectangle
(#1568)