Cargando…
Classifying Simplicial Dissections of Convex Polyhedra with Symmetry
A convex polyhedron is the convex hull of a finite set of points in [Formula: see text] 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...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7340891/ http://dx.doi.org/10.1007/978-3-030-52200-1_14 |