International audienceWe reconstruct an n-dimensional convex polytope from the knowledge of its directional moments up to a certain order. The directional moments are related to the projection of the polytope's 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 objects
Wir entwickeln eine Dualitätstransformation für Polyeder, die eine Einbettung auf dem polynomiellen ...
Die Konstruktion der konvexen Hülle einer vorgegebenen Punktmenge im endlich-dimensionalen euklidisc...
In this paper, we extend the results on sampling the signals with finite rate of innovation (FRI) [1...
We reconstruct an n-dimensional convex polytope from the knowledge of its directional moments. The d...
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...
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...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
AbstractWe develop algorithms for the approximation of a convex polytope in R3 by polytopes that are...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
This paper introduces a procedure for the calculation of the vertex positions in Marching-Cubes-like...
Wir entwickeln eine Dualitätstransformation für Polyeder, die eine Einbettung auf dem polynomiellen ...
Die Konstruktion der konvexen Hülle einer vorgegebenen Punktmenge im endlich-dimensionalen euklidisc...
In this paper, we extend the results on sampling the signals with finite rate of innovation (FRI) [1...
We reconstruct an n-dimensional convex polytope from the knowledge of its directional moments. The d...
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...
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...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
AbstractWe develop algorithms for the approximation of a convex polytope in R3 by polytopes that are...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
This paper introduces a procedure for the calculation of the vertex positions in Marching-Cubes-like...
Wir entwickeln eine Dualitätstransformation für Polyeder, die eine Einbettung auf dem polynomiellen ...
Die Konstruktion der konvexen Hülle einer vorgegebenen Punktmenge im endlich-dimensionalen euklidisc...
In this paper, we extend the results on sampling the signals with finite rate of innovation (FRI) [1...