The inverse moment problem for convex polytopes (original) (raw)
Related papers
The inverse moment problem for convex polytopes: implementation aspects
arXiv (Cornell University), 2014
Analysis and Mathematical Physics
Moment Varieties of Measures on Polytopes
ANNALI DELLA SCUOLA NORMALE SUPERIORE DI PISA - CLASSE DI SCIENZE
Moment-angle complexes and polyhedral products for convex polytopes
arXiv (Cornell University), 2010
Uniform decompositions of polytopes
Applicationes Mathematicae, 2006
On the Convex Hull of Random Points in a Polytope
Journal of Applied Probability, 1988
Explicit formulae for polyhedra moments
Pattern Recognition Letters, 2001
Polytopes: Abstract, Convex and Computational
Polytopes: Abstract, Convex and Computational, 1994
Cone decompositions of non-simple polytopes
Journal of Symplectic Geometry, 2016
A friendly invitation to Fourier analysis on polytopes
2021
A new algorithm to find all vertices of a polytope
Operations Research Letters, 1989
A Laplace transform algorithm for the volume of a convex polytope
Journal of the ACM, 2001
An output-sensitive algorithm for computing projections of resultant polytopes
Christos Konaxis, Luis Peñaranda
Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12, 2012
A friendly introduction to Fourier analysis on polytopes
2021
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
Discrete & Computational Geometry, 2002
Fast projection method for a special class of polytopes with applications
RAIRO - Operations Research, 1988
Effective lattice point counting in rational convex polytopes
Journal of Symbolic Computation, 2004
Representations and characterizations of vertices of bounded-shape partition polytopes
Linear Algebra and its Applications, 1998
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
Optimization Letters, 2008
Harmonic Center of a Closed Convex Polytope: Definition, Calculation and Some Properties
2020
Further steps on the reconstruction of convex polyominoes from orthogonal projections
Journal of Combinatorial Optimization
Efficient Computation of Newton Polytopes of Specialized Resultants
arXiv preprint arXiv:1108.5985, 2011
On the convex hull of uniform random points in a simpled-polytope
Discrete & Computational Geometry, 1991
On the upper-bound conjecture for convex polytopes
Journal of Combinatorial Theory, Series B, 1971
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
2010
Computing faces up to k dimensions of a Minkowski Sum of Polytopes
Canadian Conference on Computational Geometry, 2005
Linear time approximation of 3D convex polytopes
Computational Geometry, 2002
Reconstructing polygons from moments with connections to array processing
IEEE Transactions on Signal Processing, 1995
A simplicial algorithm for testing the integral properties of polytopes: A revision
1994
Finding Optimal Shadows of Polytopes
Discrete & Computational Geometry, 2000
Outer Normal Transforms of Convex Polytopes
Results in Mathematics, 2016