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

DOI10.1016/j.amc.2015.07.016zbMath1410.52009OpenAlexW1190198319MaRDI QIDQ669635

Apo Cihangir

Publication date: 15 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.07.016

zbMATH Keywords

triangulationnonobtuse simplex\(0/1\)-equivalence\(0/1\)-polytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55)

Related Items (1)

Foundations of space-time finite element methods: polytopes, interpolation, and integration

Uses Software

• 01poly

Cites Work

• Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)
• Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices
• The discrete maximum principle for linear simplicial finite element approximations of a reaction-diffusion problem
• Triangulations. Structures for algorithms and applications
• Minimal triangulation of the 4-cube
• Triangulations for the cube
• Simplexity of the cube
• There are only two nonobtuse binary triangulations of the unit \(n\)-cube
• The Middle-Cut Triangulations of the n-Cube
• On Nonobtuse Simplicial Partitions
• What is known about unit cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(0/1\)-polytopes with nonobtuse triangulations