Rigidity and polynomial invariants of convex polytopes

By Maksym Fedorchuk, Igor Pak. 2005

50 citations recorded by the source corpus.

Subfields: Applied Mathematics, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/da16fb7bc6860a3429683fa610c10f3754e5b537

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

1. Ivan Izmestiev
2. Alexander I. Bobenko

In Computer Graphics and Computer-Aided Design

1. Ivan Izmestiev
2. Alexander I. Bobenko
3. David Glickenstein

In Discrete Mathematics and Combinatorics

1. Ivan Izmestiev
2. Alexander I. Bobenko

Citations in the corpus

• ALEXANDROV'S THEOREM, WEIGHTED DELAUNAY TRIANGULATIONS, AND MIXED VOLUMES (2006, background): “If a development and the true edges of the polytope are known, then the problem of constructing the polytope is still non-trivial, and is studied in [11] using polynomial invariants.”