arXiv (All)
open access
A note on generating polyhedra and quadrangulations
A polyhedron is a planar, $3$-connected graph. We iteratively construct all polyhedra (save for pyramids) from a unique starting graph, namely the square pyramid, via two graph transformations. This builds upon a previous construction, that starts from the full class of pyramids, and applies the sam
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hexagonal Tiling of the Plane#177103
- A simulation-optimization approach for the 2D irregular cutting stock problem with free rotation#989662
- A Heterarchical Program for Recognition of Polyhedra#239448
- Symbolic Constraints in Polyhedral Enclosure and Tetrahedral Decomposition in Genus-0 Polyhedra#1118411
- Sylvester simplices: Triangulations and Ehrhart-theoretic aspects#1049446
Record · ID 1034603
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive