Polyhedral Complex¶
A face-closed collection of convex polyhedra whose pairwise intersections are common faces, assembling coherent geometric cells.
Core Idea¶
A polyhedral complex is, under the finite convention used here, a finite collection of convex polyhedra in one real affine space. It obeys two rules: every face of every cell belongs to the collection, and any two cells intersect, if at all, in a face of both. The union is its support; the inclusion relations among cells give its particular subdivision and adjacency. Cells may have mixed dimensions or be unbounded, and the support need not fill the ambient space.[ref-d6f127d8bd37][ref-7181fc6a6bc5]
Scope of Application¶
A square split by a diagonal into two triangles, with all edges and vertices included, is one example. Normal cones to all faces of a square form a complete fan, an unbounded conic special case. Both satisfy face closure and the common-face test despite different geometry. A simplicial complex restricts cells to simplices; a fan restricts them to cones. Extra conditions such as purity, rationality, balancing or an intrinsic metric are not implied.[^ref-d6f127d8bd37]
The live Polyhedron and Polytope entries describe possible individual cells, not this collection. CW Complex concerns topological cell attachments, while the live Polyhedral Space concerns metric gluing. Neither supplies an unconditional strict parent, so this workspace DAG proposal is unparented pending review.
Clarity¶
An arbitrary union of polygons is not enough. If two triangles meet along a subsegment that is an interior part of one triangle's edge, the intersection fails to be a face of that triangle; the cells must be refined before they form a complex. Similarly, a list of maximal triangles without edges and vertices is only shorthand for the required face-closed collection.[^ref-d6f127d8bd37]
Manages Complexity¶
The two axioms convert a drawing into checkable cell incidence. They let one enumerate faces and adjacency without ambiguous overlaps. The same support can nevertheless carry different complexes: a square alone and a square split diagonally cover the same points, but the latter adds a diagonal and changes face counts. Refinement brings representational detail at a combinatorial cost.[^ref-d6f127d8bd37]
Abstract Reasoning¶
State the ambient space and convex-cell convention. Include the full face set of each proposed cell, then check every pairwise intersection is empty or a face of each member. Only after both tests should one claim a fan, subdivision, completeness or a derived combinatorial invariant. A T-junction or overlapping interior is a diagnostic failure under an unrefined list.[ref-d6f127d8bd37][ref-7181fc6a6bc5]
Knowledge Transfer¶
For a square triangulation, the cells are bounded triangles and their faces; the two top cells meet in a shared diagonal. For the square's normal fan, the cells are four unbounded quadrant cones, boundary rays and the origin; adjacent quadrants meet in rays, and the support is the dual plane. The shared geometric roles are convex cells, face closure and mutual-face intersection. Boundedness, metrics and tropical balancing do not automatically transfer.[ref-d6f127d8bd37][ref-6c8273833155]
[^ref-d6f127d8bd37]: Bernd Sturmfels, Gröbner Bases and Convex Polytopes, ch. 2, complex definition and normal-fan discussion. https://math.berkeley.edu/~bernd/GBCP.pdf [^ref-7181fc6a6bc5]: Macaulay2 Polyhedra package, official PolyhedralComplex documentation. https://www.macaulay2.com/doc/Macaulay2-1.24.11/share/doc/Macaulay2/Polyhedra/html/___Polyhedral__Complex.html [^ref-6c8273833155]: Bernd Sturmfels, A Combinatorial Introduction to Tropical Geometry, Lecture 2, polyhedral-complex and normal-fan definitions. https://math.berkeley.edu/~bernd/tropical/sec2.pdf
Neighborhood in Abstraction Space¶
Polyhedral Complex sits in a sparse region of the domain-specific corpus (76th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Graph Structures & Combinatorial Objects (44 abstractions)
Nearest neighbors
- Polytope — 0.84
- Polyhedron — 0.84
- Sheaf — 0.83
- Euler Characteristic — 0.82
- Open Set — 0.82
Computed from structural-signature embeddings · 2026-10-08