A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
From MaRDI portal
Publication:1744887
DOI10.1007/s10589-017-9952-3zbMath1401.90164arXiv1709.06021OpenAlexW2755505503MaRDI QIDQ1744887
Henk Wymeersch, Xiao-Wen Chang, Siamak Yousefi, Godfried T. Toussaint, Benoît Champagne
Publication date: 20 April 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06021
convex optimizationcomputational geometryminimum volume enclosing ellipsoidellipsoidal outer approximationintersection of ellipsesintersection of half-planes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Finding the intersection of n half-spaces in time O(n log n)
- Ellipsoidal calculus for estimation and control
- A simple linear algorithm for intersecting convex polygons
- A subexponential bound for linear programming
- Löwner-John ellipsoids
- Lectures on Modern Convex Optimization
- A new linear algorithm for intersecting convex polygons
- Finding the smallest triangles containing a given convex polygon
- Finding minimal enclosing boxes
- Minimum Covering Ellipses
- Ellipsoidal bounds for sets of attainability and uncertainty in control problems
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Linear Matrix Inequalities in System and Control Theory
- Circumscribing an Ellipsoid about the Intersection of Two Ellipsoids
- State bounding with ellipsoidal set description of the uncertainty
This page was built for publication: A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
