On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
\(\#\mathbb{P}\)-hardnessapproximationBrunn-Minkowski theorycomputational complexitycomputational convexityconvex bodyconvex programmingdeterministic algorithmextended Gaussian imageimage processingimage reconstructionMinkowski-reconstructionmixed volumesobject recognitionpolynomial-time algorithmpolytopestability theorems
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Mixed volumes and related topics in convex geometry (52A39) (n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Convex programming (90C25) Nonlinear programming (90C30)
- Algorithms and Computation
- The complexity of the reconstruction of (r,h,v) from two projections and an approximation algorithm
- Publication:4863381
- scientific article; zbMATH DE number 4211551
- Some results and approaches for reconstruction conjectures
- On the exact maximum complexity of Minkowski sums of polytopes
- scientific article; zbMATH DE number 3906535
- Some work towards the proof of the reconstruction conjecture
- On the computational complexity of reconstructing lattice sets from their X-rays
- On the complexity of graph reconstruction
- Convex set symmetry measurement using Blaschke addition
- A new geometric approach to data analysis using the Minkowski polytope.
- Determining the right-hand vectors of an irredundant linear inequality system
- The complexity of the reconstruction of (r,h,v) from two projections and an approximation algorithm
- On the reverse Loomis-Whitney inequality
This page was built for publication: On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839902)
