arXiv (All)
open access
Peeling sequences: a directional method for the three-block construction
A \emph{peeling sequence} of a finite planar point set is an ordering of point removals, in which each point is a vertex of the convex hull of the points not yet removed. Write $g(S)$ for the number of such sequences, and $g(n)$ for the minimum of $g(S)$ over $n$-point sets in general position. We
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
- Beyond Poincar{é} recurrence: on a topological trichotomy of orbits and on the dependence of limit sets for flows on surfaces#1013359
- Line arrangements, bounded cells, and discrepancy#1048947
- When Arcs Extend Uniquely: A Higher-Dimensional Generalization of Barlotti's Result#984925
- Extended Abstract of Counting Divisorial Contractions with Centre a $cA_n$-Singularity#820933
- The OU number and Reidemeister moves of type III for link diagrams#974328
Record · ID 1014133
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