Bloating

LazySets.BloatingType
Bloating{N, S<:ConvexSet{N}} <: ConvexSet{N}

Type that represents a uniform expansion of a set in a given norm (also known as bloating).

Fields

  • X – set
  • ε – (positive) bloating factor
  • p$p$-norm (should be $≥ 1$; default: $2$)

Notes

If ε is positive, then Bloating(X, ε, p) is equivalent to the Minkowski sum of X and a ball in the p-norm of radius ε centered in the origin O (i.e., X ⊕ Ballp(p, O, ε)).

The Bloating operation preserves convexity: if X is convex, then any bloating of X is convex as well.

source
LazySets.dimMethod
dim(B::Bloating)

Return the dimension of a bloated set.

Input

  • B – bloated set

Output

The ambient dimension of the bloated set.

source
LazySets.σMethod
σ(d::AbstractVector, B::Bloating)

Return the support vector of a bloated set in a given direction.

Input

  • d – direction
  • B – bloated set

Output

The support vector of the bloated set in the given direction.

source
LazySets.ρMethod
ρ(d::AbstractVector, B::Bloating)

Return the support function of a bloated set in a given direction.

Input

  • d – direction
  • B – bloated set

Output

The support function of the bloated set in the given direction.

source
LazySets.isboundedMethod
isbounded(B::Bloating)

Determine whether a bloated set is bounded.

Input

  • B – bloated set

Output

true iff the wrapped set is bounded.

source
Base.isemptyMethod
isempty(B::Bloating)

Determine whether a bloated set is empty.

Input

  • B – bloated set

Output

true iff the wrapped set is empty.

source
LazySets.an_elementMethod
an_element(B::Bloating)

Return some element of a bloated set.

Input

  • B – bloated set

Output

An element in the bloated set.

Algorithm

The implementation returns the result of an_element for the wrapped set.

source
LazySets.constraints_listMethod
constraints_list(B::Bloating)

Return the list of constraints of a bloated set.

Input

  • B – bloated set

Output

The list of constraints of the bloated set.

Notes

The constraints list is only available for bloating in the p-norm for $p = 1$ or $p = ∞$ and if constraints_list is available for the unbloated set.

Algorithm

We call constraints_list on the lazy Minkowski sum.

source
LazySets.centerMethod
center(B::Bloating)

Return the center of a bloated set.

Input

  • B – bloated set

Output

The center of the wrapped set.

source

Inherited from ConvexSet: