Mukthineni, Tarun, authorBetten, Anton, advisorPeterson, Chris, committee memberRajopadhye, Sanjay, committee member2022-01-072022-01-072021https://hdl.handle.net/10217/234184A convex polyhedron is the convex hull of a finite set ofpoints in R3. 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 polyhedron.born digitalmasters thesesengCopyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.finiteconvex polyhedron3-simplicesalgorithmsymmetry grouppolyhedronText