arXiv (All)
open access
Symbolic Constraints in Polyhedral Enclosure and Tetrahedral Decomposition in Genus-0 Polyhedra
I present an exploratory, coordinate-free framework for organizing two related problems in polyhedral combinatorics: screening polygonal face multisets for genus-zero enclosure and examining tetrahedral decompositions that preserve the original boundary vertex set. The boundary is summarized using a
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
- A Heterarchical Program for Recognition of Polyhedra#239448
- Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover#1082916
- A note on generating polyhedra and quadrangulations#1034603
- Formulating Multistage Cutting Stock Problems as QUBO#1083546
- Pierce: GPU Ray Tracing for Spatial Joins over Complex 3D Data#1050684
Record · ID 1118411
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