-
-
Notifications
You must be signed in to change notification settings - Fork 654
Closed
Milestone
Description
In #27086 we have implemented simplicity and simpliciality for combinatorial polyhedra. We expose this methods in Polyhedron_base
.
The methods return the largest k
such that the polytope is k
-simple/simplicial. In case of unbounded polyhedra a NotImplementedError
is raised.
A polytope is k
-simplicial if every k
-face is a simplex. It is k
-simple if its dual/polar is k
-simplicial.
Component: geometry
Keywords: simplicity, simpliciality, polytopes
Author: Jonathan Kliem
Branch/Commit: 573dbfc
Reviewer: Jean-Philippe Labbé
Issue created by migration from https://trac.sagemath.org/ticket/29186