Array· 2026Q1· Review
Advances and challenges in distance geometry: A systematic review in terms of theory, applications, algorithmic efficiency, and solution quality
- 0citations
- Q1SCImago
- 2026year
Short summary
A systematic review of 75 highly significant papers (2016-2025) reveals distance geometry is advancing via algorithmic innovations and interdisciplinary applications, with notable progress in cycle-based, Riemannian, and combinatorial methods, though quantum approaches remain theoretical and challenges persist in scalability and data quality.
AI-generated from the title and abstract; the full text is not read.
Key points
- Reviewed 75 highly significant distance geometry papers from 2016-2025.
- Algorithmic innovations like cycle-based, Riemannian, and combinatorial methods show progress.
- Quantum approaches are largely theoretical with limited empirical support.
- Key challenges include scalability, noisy data, and inconsistent benchmarking.
AI-generated from the title and abstract; the full text is not read.
Abstract
Aim This systematic review investigates advances and challenges in distance geometry (DG), that focusing on algorithmic innovations, theoretical insights, and applications in structural biology and computational chemistry, robotics and motion planning, wireless networking and sensor infrastructure, complex network analysis, artificial intelligence, NLP and machine learning, structural engineering and optimization, theoretical physics and quantum computing, combinatorial optimization, visualization and topological data analysis. Method A systematic literature search of studies published between 2016 and 2025 identified 256 papers (164 via targeted queries, 72 through citation chaining). After relevance ranking, 236 were retained, and finally, 75 papers were classified as highly significant eligible studies that met the predefined relevance and quality criteria. Results The reviewed literature demonstrates continued progress in cycle-based algorithms, Riemannian optimization, combinatorial methods, and other mathematical-programming approaches. Several studies report improvements in reconstruction accuracy, convergence, or computational performance for specific problem classes. Geometric-algebra methods provide alternative mathematical formulations for selected distance-geometry problems, although their applicability and validation vary across studies. Quantum approaches remain comparatively less mature: most identified contributions are theoretical, exploratory, or prototype-based, with limited evidence regarding large-scale implementation, noise robustness, or superiority over established classical methods. Persistent challenges include scalability, incomplete and noisy distance data, inconsistent benchmarking, and limited reproducibility. Conclusion Distance geometry is advancing through the interaction of mathematical theory, algorithmic innovation, and interdisciplinary applications. However, the maturity and empirical support of different approaches vary considerably. Future research should emphasize standardized benchmarks, transparent baseline comparisons, systematic robustness testing, reproducible implementations, and experimentally validated methods for large-scale problems.
The authors' abstract, as published at the source. Array, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computer Graphics and Computer-Aided Design
Computer Graphics and Computer-Aided DesignComputer Science