BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

How to Count Euclidean Embeddings of Rigid Graphs Schicho, Josef


For a fixed rigid graph, Euclidean embeddings can be considered as solutions of a system of algebraic equations with parameters (the lengths of the edges). The number of complex solutions does not depend on the parameters, as long as they are chosen generically. We present an algorithm for computing this number.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International