1 problem
Matching
Let be a plane graph. A plane graph is generically rigid if its generic realizations are infinitesimally rigid, and it can be straightened as a pseudo-triangulation if its embe…
Let be a plane graph. A plane graph is generically rigid if its generic realizations are infinitesimally rigid, and it can be straightened as a pseudo-triangulation if its embe…