arXiv (All)
open access
Algorithmic exploration of the unit distance problem in the rational plane
This paper presents reproducible experimental evidence on unit-distance graph density. Our approach is based on a novel algorithmic exploration of the rational plane for the generation of unit-distance graphs. An efficient algorithm for this utility must perform a local-breadth search on a bounded a
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
- Comparing phylogenetic trees of stars with spectral graph distances#1062706
- Assyrian Merchants meet Nuclear Physicists: History of the Early Contributions from Social Sciences to Computer Science. The Case of Automatic Pattern Detection in Graphs (1950s-1970s)#761084
- Solid-angle based nearest-neighbor algorithm adapted for systems with low coordination number#998046
- Bond graph-based determination of characteristic polynomial of descriptor systems#159270
- A Geometry-Aware Framework for Clustering Cylindrical Data#1062218
Record · ID 926098
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