There are only two nonobtuse binary triangulations of the unit \(n\)-cube

DOI10.1016/j.comgeo.2012.09.005zbMath1261.65020arXiv1209.3875OpenAlexW2119855687MaRDI QIDQ1931275

Vincent de Haan, Michal Křížek, Sander Dijkhuis, Jan H. Brandts

Publication date: 25 January 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.3875

zbMATH Keywords

triangulationnonobtuse simplex0/1-polytopesimplexity0/1-metric

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

On \(0/1\)-polytopes with nonobtuse triangulations

This page was built for publication: There are only two nonobtuse binary triangulations of the unit \(n\)-cube