Duke Mathematical Journal · 2005 · 40 citations · 23 references
Natural SciencesComputer ScienceMathematicsAlgorithmsComputational GeometryGeometryAlgebraic GeometryConvex GeometryGeometric ConstructionsExplicit FormulaeInvariantsLower BoundsPolyhedron ConstructionPolyhedron TheoryPolynomial Invariants
We present an algebraic approach to the classical problem of constructing a simplicial convex polytope given its planar triangulation and lengths of its edges. We introduce polynomial invariants of a polytope and show that they satisfy polynomial relations in terms of squares of edge lengths. We obtain sharp upper and lower bounds on the degree of these polynomial relations. In a special case of regular bipyramid we obtain explicit formulae for some of these relations. We conclude with a proof of the Robbins conjecture on the degree of generalized Heron polynomials.
23
Archives of Ophthalmology · 1952 · 832 citations
Medicine, Ophthalmology, Surgery +5
Leonard Asimow, B. Roth · Journal of Mathematical Analysis and Applications · 1979 · 339 citations
B. Roth · American Mathematical Monthly · 1981 · 152 citations