We reconstruct an n-dimensional convex polytope from the knowledge of its directional moments. The directional moments are related to the projection of the polytope vertices on a particular direction. To extract the vertex coordinates from the moment information we combine established numerical algorithms such as generalized eigenvalue computation and linear interval interpolation. Numerical illustrations are given for the reconstruction of 2-d and 3-d convex polytopes
AbstractWe develop algorithms for the approximation of a convex polytope in R3 by polytopes that are...
We consider the task of reconstructing polytopes with fixed facet directions from finitely many supp...
In this paper we examine the problem of reconstructing a discrete two-dimensional set from its two o...
International audienceWe reconstruct an n-dimensional convex polytope from the knowledge of its dire...
We present a general and novel approach for the reconstruction of any convex d-dimensional polytope ...
This thesis deals with the reconstruction of linear forms on the polynomial ring and its application...
The problem of reconstructing an unknown polygonal shape P, viewed as a region in the complex plane...
Cette thèse porte sur la reconstruction de formes linéaires sur l'anneau des polynômes dans le cas m...
Caption title.Includes bibliographical references (p. 24-26).Supported by the Office of Naval Resear...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
We investigate algorithms for reconstructing a convex body K in Rn from noisy measurements of its su...
We study the problem of reconstructing discrete sets satisfying properties of connectivity and conve...
This paper introduces a procedure for the calculation of the vertex positions in Marching-Cubes-like...
In this paper, we extend the results on sampling the signals with finite rate of innovation (FRI) [1...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
AbstractWe develop algorithms for the approximation of a convex polytope in R3 by polytopes that are...
We consider the task of reconstructing polytopes with fixed facet directions from finitely many supp...
In this paper we examine the problem of reconstructing a discrete two-dimensional set from its two o...
International audienceWe reconstruct an n-dimensional convex polytope from the knowledge of its dire...
We present a general and novel approach for the reconstruction of any convex d-dimensional polytope ...
This thesis deals with the reconstruction of linear forms on the polynomial ring and its application...
The problem of reconstructing an unknown polygonal shape P, viewed as a region in the complex plane...
Cette thèse porte sur la reconstruction de formes linéaires sur l'anneau des polynômes dans le cas m...
Caption title.Includes bibliographical references (p. 24-26).Supported by the Office of Naval Resear...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
We investigate algorithms for reconstructing a convex body K in Rn from noisy measurements of its su...
We study the problem of reconstructing discrete sets satisfying properties of connectivity and conve...
This paper introduces a procedure for the calculation of the vertex positions in Marching-Cubes-like...
In this paper, we extend the results on sampling the signals with finite rate of innovation (FRI) [1...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
AbstractWe develop algorithms for the approximation of a convex polytope in R3 by polytopes that are...
We consider the task of reconstructing polytopes with fixed facet directions from finitely many supp...
In this paper we examine the problem of reconstructing a discrete two-dimensional set from its two o...