arXiv (All)
open access
Solid-Angle Nearest-Neighbor Method for Size-Disperse Systems of Spheres
Identifying nearest neighbors accurately is essential in particle-based simulations, from analyzing local structure to detecting phase transitions. While parameter-free methods such as Voronoi tessellation and the solid-angle nearest-neighbor (SANN) algorithm are effective in monodisperse systems, t
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
- Solid-angle based nearest-neighbor algorithm adapted for systems with low coordination number#998046
- Structural identification in general crystalline systems via Voronoi cell topology#1355417
- Extended Walk-on-Spheres Algorithm for Linear and Nonlinear Elliptic Problems of Divergence-type#625543
- Extended Walk-on-Spheres Algorithm for Linear and Nonlinear Elliptic Problems of Divergence-type#623270
- Deep learning driven framework for optimization of polycrystalline microstructures under competing strength requirements#1233500
Record · ID 1186347
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