arXiv (All)
open access
Flip-graph non-convexity for once-punctured polygons
The set of the triangulations with vertex set $X$ of a simple polygon $\mathrm{P}$ can be structured into a flip-graph $\mathcal{F}(\mathrm{P},X)$ whose edges connect two triangulations that differ by a single arc. The geometry of flip-graphs has been thoroughly studied and it is known that the subg
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
- Round-and-Round Trip#55002
- A comparison theorem for the planar strip isoperimetric problem#1131765
- Anthropologie sémiotique : interlocution transatlantique#20758
- From Corridor Selection to Earthwork: A Multi-Stage Framework for Automated Road Design via Steiner Trees and Convex Optimization#1013947
- Entorn del seminari «Geografies dissidents. Reflexions sobre la pràctica actual de la geografia» : Girona, 30 de novembre i 1 de desembre de 2001#300508
Record · ID 821347
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