Inner and outer approximations of polytopes using boxes.

DOI10.1016/S0925-7721(03)00048-8zbMath1044.65016MaRDI QIDQ1428115

Fabio D. Torrisi, Carlo Filippi, Alberto Bemporad

Publication date: 14 March 2004

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmsBoxesContainmentReachability analysis

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (12)

ROTEC: robust to early termination command governor for systems with limited computing capacity ⋮ Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding ⋮ A parallel distributed supervision strategy for multi-agent networked systems ⋮ Unnamed Item ⋮ How to solve a design centering problem ⋮ Virtual reference feedback tuning for linear discrete-time systems with robust stability guarantees based on set membership ⋮ The aggregate capacity of virtual resources – linear models ⋮ Projection-based Bayesian recursive estimation of ARX model with uniform innovations ⋮ Distributed bounded-error state estimation based on practical robust positive invariance ⋮ State and parameter estimation of state-space model with entry-wise correlated uniform noise ⋮ A combinatorial algorithm to construct 3D isothetic covers

Uses Software

• cdd

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the volume is difficult
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• On the complexity of four polyhedral set containment problems
• Optimal scaling of balls and polyhedra
• Two Algorithms for Determining Volumes of Convex Polyhedra
• Lectures on Polytopes
• Convexity recognition of the union of polyhedra

This page was built for publication: Inner and outer approximations of polytopes using boxes.