arXiv (All)
open access
Optimal Slicing Problems
Given a bounded open set $V\subset \mathbb{R}^2$, we consider the problem of slicing this set by a family of curves, whose average length is as small as possible. The first sections of the paper prove the existence of an optimal slicing and establish a connection with the problem of eradicating an i
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
- Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting#1077253
- Relative cone of curves and extremal contractions of a successive blowup#1013093
- Extremal Lin--Lu--Yau Curvature: Graph Density, Girth, and Short Cycles#986002
- Improved bounds for universal convex covers of unit arcs#1036356
- On the logarithmic slice filtration#185475
Record · ID 1130991
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