Related Experiment Video
Updated: Mar 3, 2026

A Finite Element Approach for Locating the Center of Resistance of Maxillary Teeth
Published on: April 8, 2020
Convex polyhedra with minimum and maximum names
1Geological Institute of the Kola Science Centre, Russian Academy of Sciences, 14 Fersman Street, Apatity, 184209, Russian Federation.
Abstract:
The paper reports the combinatorial types of convex n-acra (i.e. n-vertex polyhedra) for which the minimum (min.) and maximum (max.) names are attained. Hence, min. and max. names can be independently found without generating the whole combinatorial variety of convex n-acra (e.g. by the routine recurrence Fedorov algorithm) and calculating names for each n-acron.
Related Concept Videos
Optimization Problems
Hyperbolas
Hyperbolic and Inverse Hyperbolic Functions: Problem Solving
Geometry of Hyperbolas
Polar Equations of Conics
Slant Asymptotes

