arXiv (OAI Expanded)
open access
Finding a Shortest Curve that Separates Few Objects from Many
We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that separates some polygons from others. Formally, the input is a set of interior-disjoint simple polygons in the plane, where $k$ of the polygons are required to be enclosed and the remaining optional polygons have non
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
- Symbolic Constraints in Polyhedral Enclosure and Tetrahedral Decomposition in Genus-0 Polyhedra#1118411
- A Heterarchical Program for Recognition of Polyhedra#239448
- Formulating Multistage Cutting Stock Problems as QUBO#1083546
- Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover#1082916
- Framing Triangulations for Arbitrary Integer Flow Polytopes#635846
Record · ID 1110085
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