arXiv (All)
open access
Solid-angle based nearest-neighbor algorithm adapted for systems with low coordination number
Nearest-neighbor identification is central to the analysis of local structure in condensed matter systems. The solid-angle-based nearest-neighbor (SANN) algorithm is widely used offering a parameter-free and computationally efficient alternative to cutoff- or Voronoi-based methods. Unfortunately, ho
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
- Particle mesh Ewald: An <i>N</i>⋅log(<i>N</i>) method for Ewald sums in large systems#6311
- Fast Persistent Homology Computation for Functions on $\mathbb{R}$#1011944
- GPU-Accelerated Multilevel Graph Clustering: A Parallel Perspective on Louvain and Leiden#423934
- CuACD: A Fully GPU-Resident Approximate Convex Decomposition#1076387
- PESTO: Formally Correct Registration of LiDAR Point Clouds with Limited Overlap#1011783
Record · ID 998046
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