arXiv (All)
open access
The Stretch Factor of Planar Delaunay Triangulations Is Less Than 1.65
Delaunay triangulations are a fundamental class of plane spanners, and determining their worst-case stretch factor has been a longstanding problem in computational geometry. We prove an upper bound of \(1.65\), improving the bound of \(1.998\) due to Xia (2011) and reducing the gap to the known lowe
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
- Faster Algorithms for $(2k-1)$-Stretch Distance Oracles#160914
- Brunnian exotic surface links in the 4-ball#211085
- Brunnian exotic surface links in the 4-ball#210792
- Corrected Trapezoidal Rules for Near-Singular Surface Integrals Applied to 3D Ellipsoids in Stokes Flow#1141409
- Vector endpoint data for CON01-603-2.#657932
Record · ID 1014815
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