The Discrete Geodesic Problem
The DOI matches its Crossref record; 10 of the 12 references it cites were found in a registry or an index, and 2 are not checked yet.
Abstract
We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time $O(n^2 \log n)$ and requires $O(n^2 )$ space, where n is the number of edges of the surface. After we run our algorithm, the distance from the source to any other destination may be determined using standard techniques in time $O(\log n)$ by locating the destination in the subdivision created by the algorithm. The actual shortest path from the source to a destination can be reported in time $O(k + \log n)$, where k is the number of faces crossed by the path. The algorithm generalizes to the case of multiple source points to build the Voronoi diagram on the surface, where n is now the maximum of the number of vertices and the number of sources.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
Optimal Search in Planar Subdivisions
Kirkpatrick, D. (1983) · SIAM Journal on Computing · doi:10.1137/0212002 · Cited by 739
Euclidean shortest paths in the presence of rectilinear barriers
Lee, D. T., & Preparata, F. P. (1984) · Networks · doi:10.1002/net.3230140304 · Cited by 387
On Shortest Paths in Polyhedral Spaces
Sharir, M., & Schorr, A. (1986) · SIAM Journal on Computing · doi:10.1137/0215014 · Cited by 313
Triangulating a simple polygon
Garey, M. R., Johnson, D. S., Preparata, F. P., & Tarjan, R. E. (1978) · Information Processing Letters · doi:10.1016/0020-0190(78)90062-5 · Cited by 296
An algorithm for shortest-path motion in three dimensions
Papadimitriou, C. H. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90029-8 · Cited by 192
Self-citationA New Approach to Planar Point Location
Preparata, F. P. (1981) · SIAM Journal on Computing · doi:10.1137/0210035 · Cited by 127
Shortest paths on polyhedral surfaces
O’Rourke, J., Suri, S., & Booth, H. D. (2005) · Springer eBooks · doi:10.1007/bfb0024013 · Cited by 48
Voronoi Diagrams on the Surface of a Polyhedron.
Mount, D. M. (1985) · Defense Technical Information Center (DTIC) · doi:10.21236/ada166220 · Cited by 40
Self-citation
Research works printed but not linked: 4
- D. T. Lee, Proximity and reachability in the plane, Ph.D. thesis, Technical Report, ACT-12, Coordinated Science Laboratory, Univ. of Illinois, Chicago, IL, 1978, November
- J. S. B. Mitchell, Ph.D. Thesis, Planning shortest paths, Dept. of Operations Research, Stanford Univ., Stanford, CA, 1986, August, (Available as Research Report 561, Artificial Intelligence Series, No. 1, Hughes Research Laboratories, Malibu, CA.) 0755.90084
- D. M. Mount, On finding shortest paths on convex polyhedra, Technical Report, 1495, Dept. of Computer Science, Univ. of Maryland, Baltimore, MD, 1985 · doi:10.21236/ada166246
- D. M. Mount, Storing the subdivision of a polyhedral surface, Proc. 2nd ACM Symposium on Computational Geometry, Yorktown Heights, NY, 1986, June 2–4 0615.52008
Cited by
Items 701–800 of 807
Global three‐dimensional‐mesh indexing based on structural analysis and geometrical signatures
Hachani, M., Zaid, A. O., & Puech, W. (2015) · IET Computer Vision · doi:10.1049/iet-cvi.2014.0250
Synthesizing interactive fires
Perry, C. H. (1994) · DSpace@MIT (Massachusetts Institute of Technology)
General surface geometric structures and their applications
Gu, X. D., & Jin, M. (2008) · SUNY Digital Repository Support (State University of New York System)
Combinatorial optimization on embedded curves
Nayyeri, A. (2012) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Writing Chinese Calligraphy on Arbitrary Surfaces
Fu, Q., Wu, Z., Ying, X., Wang, M., Zheng, X., & Zhou, M. (2015) · International Conference on Cyberworlds (CW) · doi:10.1109/cw.2015.33
Using the parametric domain for efficient computation
Torchelsen, R. (2010) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Navigating Weighted Regions with Scattered Skinny Tetrahedra
Cheng, S.-W., Chiu, M.-K., Jin, J., & Vigneron, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48971-0_4
Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces
Guerra‐Filho, G., & de Rezende, P. J. (2011) · Canadian Conference on Computational Geometry
Obstacle-avoiding similarity metrics and shortest path problems
Cook, A. F. (2009) · TU/e Research Portal
Visibility and proximity on triangulated surfaces
Fort, M. (2008) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Robust discrete geodesic and its applications in digital geometry processing
Dao, T. P. Q. (2013) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/53515
Initial value problem of discrete geodesics and its application
Cheng, P. (2016) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/67025
Shortest Path in Transportation Network and Weighted Subdivisions
Elshawi, R., & Gudmundsson, J. (2011) · Advances in data mining and database management book series · doi:10.4018/978-1-61350-053-8.ch020
Robust sculpting using boundary represented solids
Lee, C. C. (2009) · cIRcle (University of British Columbia) · doi:10.14288/1.0051706
Efficient and Flexible Navigation Meshes for Virtual Worlds
(2016) · CRC Press eBooks · doi:10.1201/9781315370071-3
Constrained conformal/quasi-conformal map and its applications
Zhang, M. (2014) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/61764
Lian, L. (2010) · doi:10.14711/thesis-b1115261
Quadrangulations of Animation Sequence
Du, P., & Tu, C. (2017) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001417540210
Biomechanika ramenního kloubu ? obtáčení svalů
Jan, V. (2015) · Cvut DSpace (Czech Technical University)
Characterization of Multi-Spatial Errors on Freeform Surfaces with a Geodesic Structure Function
DeFisher, S., & Matthews, G. (2017) · Optical Design and Fabrication Congress · doi:10.1364/freeform.2017.jth2b.3
Touring Convex Polygons in Polygonal Domain Fences
Ahadi, A., Mozafari, A., & Zarei, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-71147-8_5
An Iterative Parallel Algorithm for Computing Geodesic Distances on Triangular MeshesPreprint
Calla, L. A. R., Perez, L. J. F., Montenegro, A. A., & Lage, M. (2018) · arXiv (Cornell University)
Cao, P. (2018) · OpenCommons - UConn (University of Connecticut)
Fang, Z. (2019) · doi:10.32657/10220/48533
Discrete geodesics and cellular automataPreprint
Arrighi, P. J., & Dowek, G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.06836
Correspondence sampling and predictive methodologies on manifolds and polyhedral surfaces
Tsagkrasoulis, D. (2016) · doi:10.25560/68027
Approximate Euclidean Shortest Paths in Polygonal Domains
Inkulu, R., & Kapoor, S. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.isaac.2019.11
Discrete Geometric Path Analysis in Computational Geometry
Gheibi, A. (2016) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2016-11226
Utilization of Scale in Keypoint Detection and Feature Description
Rhodes, A. P. (2019) · The Research Repository @ WVU (West Virginia University) · doi:10.33915/etd.7437
Shortest Secure Path in a Voronoi DiagramPreprint
Har-Peled, S., & Varadharajan, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.09773
Parallel discrete geodesic algorithms
Du, J. (2020) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/143580
Fast Exact Geodesics on Meshes
Benbaki, R., & Mukhatova, D. (2020) · HAL
Anatomy-Based Registration of Isometrically Transformed Surfaces Using Geodesic Area Functionals
Vigdor, B., & Francos, J. M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17688-3_10
Manifold Learning Projection Quality Quantitative Evaluation
Belov, V., & Mařík, R. (2021) · doi:10.1145/3507623.3507637
Ye, H. (2005) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2005-07989
An Extended MMP Algorithm: Wavefront and Cut-Locus on a Convex Polyhedron
Tateiri, K., & Ohmoto, T. (2021) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195922500029
Estimation of Vertex-wise Sulcal Width Maps on Cortical SurfacesPreprint
Fernández‐Pena, A., Navas-Sánchez, F. J., de Blas, D. M., Vidal, L. M., Gordaliza, P. M., Martínez-Tejada, I., Janssen, J., Carmona, S., Desco, M., & Alemán‐Gómez, Y. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.11.09.515775
Geometric similarity measures and their applications
Vermeulen, J. L. (2022) · Utrecht University Repository (Utrecht University) · doi:10.33540/1571
Computing and analyzing decision boundaries from shortest path maps
Sharma, R., & Kallmann, M. (2023) · Computers & Graphics · doi:10.1016/j.cag.2023.10.006
AWP: Alpha Wrapping-Based Collision-Free Surface-Along Path Planner for UAV
Choi, D., Youn, D., & Myung, H. (2023) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas59377.2023.10316938
Efficient Exact Enumeration of Single-Source Geodesics on a Non-Convex Polyhedron
Tateiri, K. (2023) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195923500048
Parallel window propagation on mesh surfaces
Hung, L. T., Trinh, D. Q., & Tho, N. H. (2023) · The University of Danang - Journal of Science and Technology · doi:10.31130/ud-jst.2023.208ict
Industrial Application: Uncertainty Quantification in Lifetime Prediction of Turbine Blades
Ryckelynck, D., Casenave, F., & Akkari, N. (2024) · SpringerBriefs in computer science · doi:10.1007/978-3-031-52764-7_5
Constant Storage for Storing Shortest Paths for a Polyhedron
Chen, J., Chintala, S., & Han, Y. (2024) · EPiC series in computing · doi:10.29007/65hn
Computational Geometry Column 35Preprint
O’Rourke, J. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9906023
Weighted Voronoi-Delaunay dual on polyhedral surfaces and its finitenessPreprint
Zhu, X. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2406.03717
Reducing Search Regions for Fast Detection of Exact Point-to-Point Geodesic Paths on Meshes
Ma, S., Wang, W., & Hou, F. (2024) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2024.3466242
Parallelization of the funnel tree algorithm for finding shortest paths on polyhedral surfaces
An, P. T., Đức, T. M., & Hoài, T. V. (2025) · Journal of Computer Science and Cybernetics · doi:10.15625/1813-9663/21653
Event-Based Flood Risk Assessment on Massive Terrains
Rav, M. (2019)
Meng, W., Yu, H., Geng, Y., Pu, Y., & Xin, S. (2025) · Tsinghua Science & Technology · doi:10.26599/tst.2024.9010181
Text Mesh Generation Based on Mesh Shape
Jung, H.-S., Kweon, S.-H., Kim, D.-H., & Yoon, S. (2025) · Journal of the Korea Computer Graphics Society · doi:10.15701/kcgs.2025.31.3.11
GeoText: Geodesic-Based 3D Text Generation on Triangular Meshes
Jung, H.-S., Kweon, S.-H., & Yoon, S. (2025) · Symmetry · doi:10.3390/sym17101727
Hu, S., Yue, Z., Chen, S., & Xin, S. (2025) · Journal of Computer-Aided Design & Computer Graphics · doi:10.3724/sp.j.1089.2023-00641
Local Routing on a Convex Polytope in R^3Preprint
Chandran, S., & Inkulu, R. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.02856
Tiling surfaces with straight strips
Kahlert, E. J. (2009) · Summit (Simon Fraser University)
A Unified Treatment of Some Nonstandard Problems in Dynamics Optimization
Vinter, R. (1989) · Springer eBooks · doi:10.1007/978-1-4757-6019-4_24
Form Finding of Deployable Elastic Gridshells Based on Nets of Geodesic Curves
Pillwein, S. (2022) · reposiTUm (TU Wien) · doi:10.34726/hss.2022.107920
Eshraghi Boroojeni, M. (2008) · Libraries and Cultural Resources (University of Calgary) · doi:10.11575/prism/2561
LIPIcs, Volume 1, STACS'08, Complete Volume
Albers, S., & Weil, P. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2008
Ryckelynck, D., Casenave, F., & Akkari, N. (2024) · OAPEN (The OAPEN Foundation)
Predição de sítios de ligação para a cisplatina e transplatina baseada em ligações de hidrogênio
dos Anjos, F. A. C. (2015) · Americanae (AECID Library)
COMPUTING INTERESTING TOPOLOGICAL FEATURES
Chambers, E. W. (2008) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
GPU Rasterization Methods for Path Planning and Multi-Agent Navigation
Madureira de Farias, R. (2020) · eScholarship (California Digital Library)
On-Mesh Bilateral Filtering: Bridging the Gap Between Texture and Object Space
Bernevig, M. (2024) · Research Repository (Delft University of Technology)
Approximations of geodesic distances for incomplete triangular manifolds
Azouz, Z. B., Bose, P., Shu, C., & Wuhrer, S. (2007) · NPARC
King, N. D., & King, N. D. (2015) · Summit (Simon Fraser University)
Smooth Bijective Projection of Polygonal Meshes via a Cubic B-Spline Shell
He, G., Wen, H., Chen, S., Lu, L., Xin, S., & Tu, C. (2025) · CSIAM Transactions on Applied Mathematics · doi:10.4208/csiam-am.so-2025-0071
Biharmonic Distance Driven Voronoi Diagrams Restricted on Curved Surfaces
Zhao, X., Wang, P., Xu, Y., & Chen, S. (2026) · CSIAM Transactions on Applied Mathematics · doi:10.4208/csiam-am.so-2025-0066
A Primal-Dual Level Set Method for Computing Geodesic Distances
Liu, H., & Zinnel, L. (2026) · SIAM Journal on Numerical Analysis · doi:10.1137/24m1721086
Shortest Paths on Convex Polyhedral Surfaces
Wang, H. (2025) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs63196.2025.00121
Convex Quadratic Distance Field ComputationPreprint
Ruan, Y., Chern, A., Li, T.-M., Subr, K., & Vaxman, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.03231
Mesh Processing Non‐Meshes via Neural Displacement Fields
Noma, Y., Wang, Z., Liu, C., Singh, K., & Jacobson, A. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70354
Development of a computational and neuroinformatics framework for large-scale brain modelling
Sanz‐Leon, P. (2014) · theses.fr (ABES) · doi:10.70675/95aa5361zb69ez4251z8f52zdb68cf9af526
Hachani, M. (2015) · theses.fr (ABES) · doi:10.70675/3dddf517z91c8z4d46z9f5bz9563cd958bb8
Computing Geodesic Path Distances in Toggleable Regular Grid
Noh, S. (2025) · Graphics Interface · doi:10.1145/3769872.3769901
Lonjaret, L. T. (2017) · theses.fr (ABES) · doi:10.70675/03b680efzb75bz483cz9cc3z5e3762721ed3
Dimension reduction for fluid simulation and animation
Paliard, C. (2024) · theses.fr (ABES) · doi:10.70675/2783e762z9bfaz4974z9483zf9e72247a775
Stratified problems in dynamic optimization
Wahab, A. A. (2025) · theses.fr (ABES) · doi:10.70675/ed02c0e0z580fz451cza0d9z39ceb2a16bea
Algorithms for Topological and Metric Surfaces
Dubois, L. (2025) · theses.fr (ABES) · doi:10.70675/8ae82970zbc81z4f4bz80dfzd060ad7eb045
Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations
Layton, J., Samavati, F. F., & Runions, A. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70324
Embedding Optimization of Layouts via Distortion Minimization
Heuschling, A., Lim, I., & Kobbelt, L. P. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70421
NeuralSketch2Surf: Fast Neural Surfacing of Unoriented 3D Sketches
Ye, H., Sureshkumar, A., Zhonghan, W., Hahmann, S., Cani, M., Bonneau, G., & Parakkat, A. D. (2026) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/3799902.3811227
Constrained Shortest Path Finding on Terrain Surfaces
Wei, V. J., Xie, M., & Wang, W. (2026) · Proceedings of the ACM on Management of Data · doi:10.1145/3802031
A Terrain-Adaptive $\epsilon$-Constraint MPC for Uneven Terrain Kinodynamic Planning
Jerome, O., Kulathunga, G., & do Nascimento, T. (2026) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2026.3728313
Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface
Dubois, L. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.socg.2026.40
Robust curve embedding in inconsistent surface meshes
Schier, A., & Klein, R. (2026) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2026.102588
Jin, L., Alqaydi, M., Abduljawad, M., Mohammed, Y., AlAttar, A., Taha, T., & Gan, D. (2026) · Mechanism and Machine Theory · doi:10.1016/j.mechmachtheory.2026.106532
Optimal any-angle path planning in static and dynamic environments
Zou, Y., & Borst, C. (2026) · Artificial Intelligence · doi:10.1016/j.artint.2026.104642
Intrinsic Meshing of Closed Surfaces Using Geodesic DistancesPreprint
Gabriel, T., Remacle, J.-F., & Geuzaine, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.04989
Thalamocortical Architecture Shapes Structural and Functional Plasticity After Early Sensory LossPreprint
Nishio, M., Liu, X., Xu, Y., Zimmermann, M., Szwed, M., Collignon, O., Mackey, A. P., & Arcaro, M. J. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7554220
Surface-Driven Yarn Layout Generation for Shape-Adaptive Woven Composite Preforms on Curved SurfacesPreprint
Zhai, Y., Zhou, Z., Yuan, Z., Sun, Z., Guo, Z., & Wang, J. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7177625
Thalamocortical architecture shapes structural and functional plasticity after early sensory lossPreprint
Nishio, M., Liu, X., Xu, Y., Zimmermann, M., Szwed, M., Collignon, O., Mackey, A. P., & Arcaro, M. J. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.08.05.743029
The Hyperbolic Surface Distance, Diameter, and Dirichlet ProblemsPreprint
Despré, V., Gezalyan, A. H., & Pouget, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.09549
Learning Geometry-Aware Embedding Fields for Intrinsic Riemannian Mappings
Pang, B., Foti, S., & Birdal, T. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37602-2_28
Accelerating HKTex without Mesh Eigensystems: Local Unfolding and Randomized Thermal FeaturesPreprint
He, Z., Hu, J., & Fang, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.14105
Semantic Map Sharing and Capability-Aware Coverage Planning for AI-Native 6G Robotic Coordination
Dhafer, A., Wang, Q. R., & Hao, Z. (2026) · IEEE Conference on Standards for Communications and Networking · doi:10.1109/cscn71666.2026.11771590
Robot Learning on Discrete Surfaces: Theory and ApplicationsPreprint
Vedove, M. D., Abu‐Dakka, F. J., Palopoli, L., Fontanelli, D., & Saveriano, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.01910
Shortest Paths in Domains with Crack-Induced ConstraintsPreprint
The, P. D., & An, P. T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.09540
Metadata
- Authors
- Mitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H.
- Affiliations
- Stanford University (US)
- University of Maryland, Baltimore (US)
- Venue
- SIAM Journal on Computing
- Published
- 1987-08
- Volume
- 16
- Issue
- 4
- Pages
- 647-668
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2108567935
- Cited by
- 720
- References
- 11
- Citations by year
- 2026: 17 · 2025: 25 · 2024: 28 · 2023: 39 · 2022: 22 · 2021: 27 · 2020: 25 · 2019: 29 · 2018: 24 · 2017: 26 · 2016: 25 · 2015: 35 · 2014: 34 · 2013: 31 · 2012: 26
- FWCI
- 12.77
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- SIAM Journal on Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Keywords
- non-convex polyhedra, Euclidean distance, shortest path algorithms, computational geometry
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.