Constructing Triangulations and Polyhedra with Dihedral Symmetry

Year: 2025 Authors: Meike Weiß; Vanishree Krishna Kirekod; Reymond Akpanya; Alice C. Niemeyer; Daniel Robertz

Core claim

Grünbaum-colorings enable the construction of maximal planar graphs that embed as congruent-triangle polyhedra with dihedral symmetry.

Topics

planar triangulations, dihedral symmetry, congruent triangles, graph embeddings

Domains

graph theory, planar graph theory, polyhedral combinatorics, group actions, polyhedra, visual geometry, computational design

Methods

Grünbaum-coloring, distance equations, computer algebra, embedding construction

Media

Euclidean 3-space, GAP, Maple, GAPic

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.