Convex sets (ConvexSet)
Every convex set in this library implements this interface.
LazySets.ConvexSet — TypeConvexSet{N} <: LazySet{N}Abstract type for convex sets, i.e., sets characterized by a (possibly infinite) intersection of halfspaces, or equivalently, sets $S$ such that for any two elements $x, y ∈ S$ and $0 ≤ λ ≤ 1$ it holds that $λ·x + (1-λ)·y ∈ S$.
This interface defines the following functions (undocumented):
Inherited from LazySet:
an_elementareachebyshev_center_radiuscomplementconcretizeconstraintsconvex_hullcopy(::Type{LazySet})delaunaydiametereltypeeltypeextremaextremahighhighisboundedisboundedtypeisemptyisoperationispolyhedrallowlownormpolyhedronradiusrationalizerectifyreflectsingleton_listsurfacetosimplehreptriangulateverticesaffine_mapexponential_mapis_interior_pointlinear_mapprojectsamplescaleρtranslatecartesian_productconvex_hullexact_sum≈isdisjoint==isequivalent⊂⊆minkowski_differenceminkowski_sum