LazySets.jl logo
LazySets.jl
  • Home
  • Manual
    • Getting Started
    • Optional Features
    • A Tour of LazySets
    • Introduction to Convex Sets
    • Polyhedral Approximations
    • Decomposing an Affine Map
    • Fast 2D LPs
    • Iterative Refinement
    • Interval Hulls
    • Convex Hulls
    • Unary Operations on Sets
    • A Reachability Algorithm
    • A Hybrid Reachability Algorithm
    • Concrete Polyhedra
    • Parallel Approximations
    • Lazy Intersections
  • Library
    • API
      • Overview
      • General sets (LazySet)
      • Convex sets (ConvexSet)
      • Centrally symmetric sets (AbstractCentrallySymmetric)
      • Polyhedra (AbstractPolyhedron)
      • Polytopes (AbstractPolytope)
      • Polygons (AbstractPolygon)
      • Polygons in constraint representation (AbstractHPolygon)
      • Centrally symmetric polytopes (AbstractCentrallySymmetricPolytope)
      • Zonotopes (AbstractZonotope)
      • Hyperrectangles (AbstractHyperrectangle)
      • Singletons (AbstractSingleton)
      • Affine maps (AbstractAffineMap)
      • Polynomial zonotope sets (AbstractPolynomialZonotope)
      • Sparse polynomial zonotope sets (AbstractSparsePolynomialZonotope)
      • Balls in the p-norm (AbstractBallp)
      • Ball1
      • Ball2
      • BallInf
      • Ballp
      • DensePolynomialZonotope
      • Ellipsoid
      • EmptySet
      • HalfSpace
      • HParallelotope
      • HPolygon
      • HPolygonOpt
      • HPolyhedron
      • HPolytope
      • Hyperplane
      • Hyperrectangle
      • Interval
      • Line2D
      • Line
      • LineSegment
      • Polygon
      • SimpleSparsePolynomialZonotope
      • SparsePolynomialZonotope
      • Singleton
      • Star
      • Tetrahedron
      • Universe
      • VPolygon
      • VPolytope
      • ZeroSet
      • Zonotope
      • ZonotopeMD
      • AffineMap
      • Bloating
      • CartesianProduct
      • Complement
      • ConvexHull
      • ExactSum
      • ExponentialMap
      • Intersection
      • LinearMap
      • InverseLinearMap
      • MinkowskiSum
      • QuadraticMap
      • Rectification
      • ResetMap
      • SymmetricIntervalHull
      • Translation
      • UnionSet
      • Binary set operations
      • Cartesian Product
      • Convex Hull
      • Set difference
      • Distance
      • Intersection of two sets
      • Minkowski Sum
      • Minkowski Difference
      • Check for Disjointness of Sets
      • Subset Check
    • Conversions between set representations
      • Overview
      • Overapproximation
      • Box Approximation
      • Iterative refinement
      • Template directions
      • Underapproximation
      • Approximation
      • Cartesian Decomposition
      • Hausdorff Distance
      • Norm Overapproximation
      • Overapproximation
      • MatrixZonotope
    • Utilities
    • Parallel
  • Bibliography
  • About
Version
  • Library
  • Lazy Operations
  • ExactSum
  • ExactSum
GitHub

Exact Sum (ExactSum)

LazySets.ExactSum — Type
ExactSum{N,S1<:LazySet{N},S2<:LazySet{N}} <: LazySet{N}

Type that represents the exact sum of two sets Kochdumper and Althoff [KA21], Proposition 10

Fields

  • X – set
  • Y – set

Notes

The convenience aliases ⊞ is also available. ⊞ can be typed by \boxplus<tab>.

source
« ConvexHullExponentialMap »

Powered by Documenter.jl and the Julia Programming Language.

Settings


This document was generated with Documenter.jl version 1.17.0 on Friday 6 March 2026. Using Julia version 1.12.5.