2 papers
math.GT2023
Rigidity of nonconvex polyhedra with respect to edge lengths and dihedral angles
Yunhi Cho, Seonhwa Kim
We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible suffici…
math.MG2016
A classification of polyhedral graph by combinatorially rigid vertices
Seonhwa Kim, Yunhi Cho
When the number of non-triangular faces adjacent to a vertex is less than or equal to three, the vertex will be called (\emph{combinatorially}) \emph{rigid}. We study the n…