Research

*

Bricard's octahedra

New proof of the classification of Bricard’s octahedra

Movable Graphs

Graphs with infinitely many realizations in the plane satisfying edge length constraints

Number of Real Embeddings of Minimally Rigid Graphs

Finding edge lengths of minimally rigid graphs with many real embeddings.

Construction of algorithms for Parallel Addition

Parallel Addition algorithms in non-standard numeration systems are constructed by so called Extending Window Method.

Publications

More Publications

. On the existence of paradoxical motions of generically rigid graphs on the sphere. SIAM Journal on Discrete Mathematics, 2021.

Preprint Project DOI

. Combinatorics of Bricard's octahedra. Comptes Rendus. Mathématique, 2021.

Preprint Project DOI

. On the maximal number of real embeddings of minimally rigid graphs in $\mathbb{R}^2$, $\mathbb{R}^3$ and $S^2$. Journal of Symbolic Computation, 2021.

Preprint Dataset Project DOI

. On the Classification of Motions of Paradoxically Movable Graphs. Journal of Computational Geometry, 2020.

Preprint Code Project DOI

. Zero-sum cycles in flexible polyhedra. submitted, 2020.

Preprint Project

Talks

More Talks

Zero-sum cycles: a necessary condition for the flexibility of polyhedra
Jun 16, 2021
Workshop on Real Algebraic Geometry and Algorithms for Geometric Constraint Systems, Thematic Program on Geometric Constraint Systems, Framework Rigidity, and Distance Geometry
Characterizing infinite graphs allowing flexible frameworks
Jun 10, 2021
MEGA 2021
PDF Project Slides Video Teaser
Bracing frameworks using edge colorings
Feb 23, 2021
Workshop on Progress and Open Problems in Rigidity Theory, Thematic Program on Geometric Constraint Systems, Framework Rigidity, and Distance Geometry
Project Video

Contact