This repository was archived by the owner on Jan 30, 2023. It is now read-only.
-
-
Notifications
You must be signed in to change notification settings - Fork 7
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
82 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
78 changes: 78 additions & 0 deletions
78
src/doc/en/thematic_tutorials/geometry/is_this_polyhedron.rst
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,78 @@ | ||
.. -*- coding: utf-8 -*- | ||
.. linkall | ||
.. _related_objects: | ||
|
||
============================================================== | ||
Is this polyhedron ... the one your looking for? | ||
============================================================== | ||
|
||
.. MODULEAUTHOR:: Jean-Philippe Labbé <[email protected]> | ||
|
||
Once a polyhedron object is constructed, it is often useful to check if it has certain | ||
properties. | ||
|
||
Here is a list of properties that Sage can check. | ||
|
||
.. note:: | ||
|
||
The following list may note be complete due to recent additions of features. You can | ||
check by making a :code:`tab` completion after typing :code:`is_` to see which methods | ||
are available. | ||
|
||
Combinatorial isomorphism | ||
============================================================== | ||
|
||
Two polyhedra are *combinatorially isomorphic* if their face lattices are isomorphic. | ||
|
||
The verification of this is done using the vertices to facets adjacency oriented graph. | ||
|
||
:: | ||
|
||
sage: P1 = Polyhedron(vertices = [[1, 0], [0, 1]], rays = [[1, 1]]) | ||
sage: P7 = Polyhedron(vertices = [[3, 0], [4, 1]], rays = [[-1, 1]]) | ||
sage: P1_and_P7 = P1 & P7 | ||
sage: Square = Polyhedron(vertices = [[1, -1, -1], [1, -1, 1], [1, 1, -1], [1, 1, 1]]) | ||
sage: Square.is_combinatorially_isomorphic(P1_and_P7) | ||
True | ||
|
||
.. end of output | ||
Compactness or is it a polytope | ||
============================================================== | ||
|
||
Emptyness | ||
============================================================== | ||
|
||
Full-dimension | ||
============================================================== | ||
|
||
Lattice polyhedron | ||
============================================================== | ||
|
||
Inscribed on a sphere | ||
============================================================== | ||
|
||
Minkowski summand | ||
============================================================== | ||
|
||
Neighborlyness | ||
============================================================== | ||
|
||
Reflexiveness | ||
============================================================== | ||
|
||
Simplicity | ||
============================================================== | ||
|
||
Simpliciality | ||
============================================================== | ||
|
||
Is it the simplex? | ||
============================================================== | ||
|
||
Is it the whole space? | ||
============================================================== | ||
|
||
'is_universe' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters