Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
From MaRDI portal
DOI10.1006/JAGM.1999.1031zbMATH Open0937.68135OpenAlexW2070749444MaRDI QIDQ4939610FDOQ4939610
Authors: Mario A. Lopez, Shlomo Reisner
Publication date: 6 February 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1031
Recommendations
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (15)
- A node elimination algorithm for cubature of high-dimensional polytopes
- Hausdorff approximation of 3D convex polytopes
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- For describing uncertainty, ellipsoids are better than generic polyhedra and probably better than boxes: a remark
- Goffin's algorithm for zonotopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elliptic polytopes and invariant norms of linear operators
- An ellipsoid algorithm for the computation of fixed points
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Title not available (Why is that?)
- Approximate ellipsoid in the streaming model
- Title not available (Why is that?)
- Linear time approximation of 3D convex polytopes
- Title not available (Why is that?)
This page was built for publication: Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939610)