Talk:Graph flattenability

Article summary
This page is one in a collection of pages on rigidity theory, distance geometry, and configuration spaces of flexible frameworks. These pages were planned and organized by Dr. Meera Sitharam at the University of Florida and her class of 20+ graduate students during the Spring 2020 semester. Below is the list of contributors from this class. Several of these pages were also heavily edited by William Sims for his PhD qualifying exam under Dr. Meera Sitharam. These pages will continue to be revised over the next 6 months by experts, post-docs, and graduate students participating in the Fields Institute's Thematic Program on Geometric Constraint Systems, Framework Rigidity, and Distance Geometry. Below is a diagram of these pages (colored) showing how they connect to each other and to larger areas (gray).

Usernames/names of contributors from Dr. Meera Sitharam's Spring 2020 graduate course by page:

Automated geometry theorem proving - Alexcooper

Cayley configuration space - Ajha, William Sims, Yichi Zhang

Decomposition Recombination Planning - Rahul Pabhu

Distance geometry - Micstein, William Sims

Distance geometry: Cayley Menger Relations - Abhik18

Geiringer-Laman theorem - William Sims, Vriddhipai

Geometric constraint solving - Kyleshihhuanglo, Rahul Prabhu

Geometric constraint system - Cwphang, Kyuseopark, Rahul Prabhu, William Sims

Geometric rigidity - W.garcia, William Sims

Graph flattenability - William Sims

Pebble game - Adityatharad

Quadratic solvability - Yichi Zhang

Sparsity matroid - Banouge, William Sims, Vriddhipai

Structural rigidity - William sims, Tgandi

Tree-decomposable graph - Bhattabhishek, William Sims



William Sims (talk) 23:45, 25 January 2021 (UTC)