From 0845f0381c559acfa648c9828099ca0c4d38ba8a Mon Sep 17 00:00:00 2001 From: Matthias Koeppe Date: Sat, 6 Aug 2022 14:23:29 -0700 Subject: [PATCH] Triangulation.boundary_simplicial_complex: Expand example --- src/sage/geometry/triangulation/element.py | 13 ++++++++++--- 1 file changed, 10 insertions(+), 3 deletions(-) diff --git a/src/sage/geometry/triangulation/element.py b/src/sage/geometry/triangulation/element.py index ebb60a72584..48f16e8ed06 100644 --- a/src/sage/geometry/triangulation/element.py +++ b/src/sage/geometry/triangulation/element.py @@ -686,15 +686,22 @@ def boundary_simplicial_complex(self): EXAMPLES:: sage: p = polytopes.cuboctahedron() - sage: sc = p.triangulate(engine='internal').boundary_simplicial_complex() - sage: sc + sage: triangulation = p.triangulate(engine='internal') + sage: bd_sc = triangulation.boundary_simplicial_complex() + sage: bd_sc Simplicial complex with 12 vertices and 20 facets The boundary of every convex set is a topological sphere, so it has spherical homology:: - sage: sc.homology() + sage: bd_sc.homology() {0: 0, 1: 0, 2: Z} + + It is a subcomplex of ``self`` as a :meth:`simplicial_complex`:: + + sage: sc = triangulation.simplicial_complex() + sage: all(f in sc for f in bd_sc.maximal_faces()) + True """ from sage.topology.simplicial_complex import SimplicialComplex return SimplicialComplex(self.boundary(), maximality_check=False)