arXiv (All)
open access
Osculating Geometry and Higher-Order Distance Loci
We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order tangency. We focus on the data locus of points possessing at least o
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
- Proximity Operator of the $\ell_1$ over $\ell_2$ Function#821776
- Multi-axis Analysis of Image Manipulation Localization#204767
- Search-Bound Proximity Proofs: Binding Encrypted Geographic Search to Zero-Knowledge Verification#2520
- Recognizability of Being Point Determining#1129396
- Carrying Location Objects in RADIUS and Diameter#420499
Record · ID 997976
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