Home > Research > Publications & Outputs > Braced triangulations and rigidity

Associated organisational unit

Electronic data

  • Braced_Plane_Triangulations

    Accepted author manuscript, 433 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

View graph of relations

Braced triangulations and rigidity

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Forthcoming

Standard

Braced triangulations and rigidity. / Cruickshank, James; Kastis, Eleftherios; Kitson, Derek et al.
In: Discrete and Computational Geometry, 02.07.2023.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Cruickshank, J, Kastis, E, Kitson, D & Schulze, B 2023, 'Braced triangulations and rigidity', Discrete and Computational Geometry.

APA

Cruickshank, J., Kastis, E., Kitson, D., & Schulze, B. (in press). Braced triangulations and rigidity. Discrete and Computational Geometry.

Vancouver

Cruickshank J, Kastis E, Kitson D, Schulze B. Braced triangulations and rigidity. Discrete and Computational Geometry. 2023 Jul 2.

Author

Cruickshank, James ; Kastis, Eleftherios ; Kitson, Derek et al. / Braced triangulations and rigidity. In: Discrete and Computational Geometry. 2023.

Bibtex

@article{c7533f5e8c474eaeb69d99319d3635e3,
title = "Braced triangulations and rigidity",
abstract = "We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges braces). We show that for any positive integer \( b \) there is such an inductive construction of triangulations with \( b \) braces, having finitely many base graphs. In particular we establish a bound for the maximum size of a base graph with $b$ braces that is linear in $b$. In the case that $b=1$ or $2$ we determine the list of base graphs explicitly. Using these results we show that doubly braced triangulations are generically) minimally rigid in two distinct geometric contexts arising from a hypercylinder in $\mathbb{R}^4$ and a class of mixed norms on $\mathbb{R}^3$.",
author = "James Cruickshank and Eleftherios Kastis and Derek Kitson and Bernd Schulze",
year = "2023",
month = jul,
day = "2",
language = "English",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",

}

RIS

TY - JOUR

T1 - Braced triangulations and rigidity

AU - Cruickshank, James

AU - Kastis, Eleftherios

AU - Kitson, Derek

AU - Schulze, Bernd

PY - 2023/7/2

Y1 - 2023/7/2

N2 - We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges braces). We show that for any positive integer \( b \) there is such an inductive construction of triangulations with \( b \) braces, having finitely many base graphs. In particular we establish a bound for the maximum size of a base graph with $b$ braces that is linear in $b$. In the case that $b=1$ or $2$ we determine the list of base graphs explicitly. Using these results we show that doubly braced triangulations are generically) minimally rigid in two distinct geometric contexts arising from a hypercylinder in $\mathbb{R}^4$ and a class of mixed norms on $\mathbb{R}^3$.

AB - We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges braces). We show that for any positive integer \( b \) there is such an inductive construction of triangulations with \( b \) braces, having finitely many base graphs. In particular we establish a bound for the maximum size of a base graph with $b$ braces that is linear in $b$. In the case that $b=1$ or $2$ we determine the list of base graphs explicitly. Using these results we show that doubly braced triangulations are generically) minimally rigid in two distinct geometric contexts arising from a hypercylinder in $\mathbb{R}^4$ and a class of mixed norms on $\mathbb{R}^3$.

M3 - Journal article

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

ER -