A convex polyhedron is the convex hull of a finite set of points in A triangulation of a convex polyhedron is a decomposition into a finite number of 3-simplices such that any two intersect in a common face or are disjoint. A simplicial dissection is a decomposition into a finite number of 3-simplices such that no two share an interior point. We present an algorithm to classify the simplicial dissections of a regular polyhedron under the symmetry group of the prolyhedron.
CITATION STYLE
Betten, A., & Mukthineni, T. (2020). Classifying Simplicial Dissections of Convex Polyhedra with Symmetry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12097 LNCS, pp. 143–152). Springer. https://doi.org/10.1007/978-3-030-52200-1_14
Mendeley helps you to discover research relevant for your work.