Classifying Simplicial Dissections of Convex Polyhedra with Symmetry

DOI10.1007/978-3-030-52200-1_14zbMath1503.52003OpenAlexW3041180688MaRDI QIDQ5039566

Tarun Mukthineni, Anton Betten

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-52200-1_14

zbMATH Keywords

geometryclassificationtriangulationpolyhedradissectioncomputational group theory

Mathematics Subject Classification ID

Dissections and valuations (Hilbert's third problem, etc.) (52B45) Computational methods for problems pertaining to convex and discrete geometry (52-08)

Uses Software

• nauty
• TOPCOM
• Orbiter
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulations. Structures for algorithms and applications
• Minimal simplicial dissections and triangulations of convex 3-polytopes
• Parallel enumeration of triangulations
• How fast can we compute orbits of groups?
• The polytope of all triangulations of a point configuration
• Counting with groups and rings.
• Isomorph-Free Exhaustive Generation