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: | Betten, Anton, Mukthineni, Tarun |
---|---|
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 |
Ejemplares similares
-
Convex Polyhedra
por: Alexandrov, A D
Publicado: (2005) -
Intersecting dilated convex polyhedra method for modeling complex particles in discrete element method
por: Nye, Ben, et al.
Publicado: (2014) -
In Simplici Salus
Publicado: (1891) -
Stratified polyhedra
por: Stone, David A
Publicado: (1972) -
A Keplerian Ag(90) nest of Platonic and Archimedean polyhedra in different symmetry groups
por: Su, Yan-Min, et al.
Publicado: (2020)