Skip to content

Add simplicity and simpliciality to polyhedra #29186

@kliem

Description

@kliem

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.

CC: @jplab @LaisRast

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

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions