Interpolation by Convex Algebraic Hypersurfaces

Eugenii Shustin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


LetΣbe the set of vertices of a convex non-degenerate polyhedron inRn,n≥2. We suggest an algorithm to construct smooth convex algebraic hypersurfaces of degree as small as possible, going throughΣ.

Original languageEnglish
Pages (from-to)304-315
Number of pages12
JournalJournal of Approximation Theory
Issue number3
StatePublished - Mar 1997


Dive into the research topics of 'Interpolation by Convex Algebraic Hypersurfaces'. Together they form a unique fingerprint.

Cite this