The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Generalized delaunay triangulation for planar graphs
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“DT can effectively interpolate all locations in the map even original position is far from the nearest point.”
From MME-YOLO: Multi-Sensor Multi-Level Enhanced YOLO for Robust Vehicle Detection in Traffic Surveillance (2020) · cites this paper as [25]
Citations
Cites
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,812
An efficient algorith for determining the convex hull of a finite planar set
Graham, R. L. (1972) · Information Processing Letters · doi:10.1016/0020-0190(72)90045-2 · Cited by 1,718
Two algorithms for constructing a Delaunay triangulation
Lee, D. T., & Schachter, B. J. (1980) · International Journal of Computer & Information Sciences · doi:10.1007/bf00977785 · Cited by 1,584
Self-citationShamos, M. I., & Hoey, D. (1975) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1975.8 · Cited by 1,101
Optimal Search in Planar Subdivisions
Kirkpatrick, D. (1983) · SIAM Journal on Computing · doi:10.1137/0212002 · Cited by 739
Software for C1 Surface Interpolation
Lawson, C. L. (1977) · Mathematical Software · doi:10.1016/b978-0-12-587260-7.50011-x · Cited by 730
On the Angle Condition in the Finite Element Method
Babuska, I. M., & Aziz, A. K. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713021 · Cited by 649
Optimal Point Location in a Monotone Subdivision
Edelsbrunner, H., Guibas, L. J., & Stolfi, J. (1986) · SIAM Journal on Computing · doi:10.1137/0215023 · Cited by 502
Piecewise Quadratic Approximations on Triangles
Powell, M. J. D., & Sabin, M. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355759.355761 · Cited by 433
Finding the convex hull of a simple polygon
Graham, R. L., & Yao, F. F. (1983) · Journal of Algorithms · doi:10.1016/0196-6774(83)90013-5 · Cited by 398
Research works printed but not linked: 2
- B. M. Chazelle and J. Inceipi, Triangulating a polygon by divide-and-conquer,Proceedings of the 21st Allerton Conference on Communications Control and Computers, 447–456, October, 1983.
- T. M. Yeung, Generalization of Delaunay triangulation, M.Sc. thesis, Department of EE/CS, Northwestern University, May, 1980.
Cited by
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Si, H. (2015) · ACM Transactions on Mathematical Software · doi:10.1145/2629697 · Cited by 1,573
Delaunay refinement algorithms for triangular mesh generation
Shewchuk, J. R. (2002) · Computational Geometry · doi:10.1016/s0925-7721(01)00047-5 · Cited by 1,153
Constrained delaunay triangulations
Paul Chew, L. (1989) · Algorithmica · doi:10.1007/bf01553881 · Cited by 750
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
Ruppert, J. (1995) · Journal of Algorithms · doi:10.1006/jagm.1995.1021 · Cited by 697
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
Aurenhammer, F., & Klein, R. (2000) · Elsevier eBooks · doi:10.1016/b978-044482537-7/50006-1 · Cited by 417
Bern, M. W., Eppstein, D., & Gilbert, J. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80059-5 · Cited by 350
A linear-time algorithm for computing the voronoi diagram of a convex polygon
Aggarwal, A., Guibas, L. J., Saxe, J. B., & Shor, P. W. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187749 · Cited by 291
Guaranteed-Quality Triangular Meshes
Chew, L. P. (1989) · Defense Technical Information Center (DTIC) · doi:10.21236/ada210101 · Cited by 281
Constrained Delaunay triangulations
Chew, L. P. (1987) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/41958.41981 · Cited by 280
Topology control for multihop packet radio networks
Hu, L. (1993) · IEEE Transactions on Communications · doi:10.1109/26.237882 · Cited by 255
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
Si, H., & Gärtner, K. (2006) · Springer eBooks · doi:10.1007/3-540-29090-7_9 · Cited by 246
Mesh generation: Art or science?
Baker, T. J. (2005) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2005.02.002 · Cited by 226
Conservative interpolation between unstructured meshes via supermesh construction
Farrell, P., Piggott, M. D., Pain, C. C., Gorman, G., & Wilson, C. R. (2009) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2009.03.004 · Cited by 220
Baker, T. J. (1989) · Engineering With Computers · doi:10.1007/bf02274210 · Cited by 214
Delaunay triangulations in TIN creation: an overview and a linear-time algorithm
Tsai, V. J. D. (1993) · International Journal of Geographical Information Systems · doi:10.1080/02693799308901979 · Cited by 191
Robust Computational Algorithms for Dynamic Interface Tracking in Three Dimensions
Glimm, J. G., Grove, J. W., Li, X. L., & Tan, D. C. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598340500 · Cited by 163
Brittle fracture in polycrystalline microstructures with the extended finite element method
Sukumar, N., Srolovitz, D. J., Baker, T. J., & Prévost, J. (2003) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.653 · Cited by 160
Automated Thiessen polygon generation
Han, D., & Bray, M. (2006) · Water Resources Research · doi:10.1029/2005wr004365 · Cited by 150
Triangulation of trimmed surfaces in parametric space
Sheng, X., & Hirsch, B. E. (1992) · Computer-Aided Design · doi:10.1016/0010-4485(92)90011-x · Cited by 150
A new and simple algorithm for quality 2-dimensional mesh generation
Ruppert, J. (1993) · UC Berkeley · doi:10.5555/313559.313615 · Cited by 133
A fast algorithm for generating constrained delaunay triangulations
Sloan, S. W. (1993) · Computers & Structures · doi:10.1016/0045-7949(93)90239-a · Cited by 129
Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery.
Shewchuk, J. R. (2002) · Cited by 123
Representing stereo data with the Delaunay triangulation
Faugeras, O. D., Bras-Mehlman, E. L., & Boissonnat, J. D. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90098-k · Cited by 123
Bose, P. K., & Hurtado, F. (2008) · Computational Geometry · doi:10.1016/j.comgeo.2008.04.001 · Cited by 108
Constrained Delaunay tetrahedral mesh generation and refinement
Si, H. (2009) · Finite Elements in Analysis and Design · doi:10.1016/j.finel.2009.06.017 · Cited by 107
Shewchuk, J. R. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9060-3 · Cited by 106
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
Shewchuk, J. R. (1998) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/276884.276893 · Cited by 101
Lecture Notes on Delaunay Mesh Generation
Shewchuk, J. R. (2012) · Cited by 100
An on-line algorithm for constrained Delaunay triangulation
Floriani, L. D., & Puppo, E. (1992) · CVGIP Graphical Models and Image Processing · doi:10.1016/1049-9652(92)90076-a · Cited by 95
Applications of Computational Geometry to Geographic Information Systems
Floriani, L. D., Magillo, P., & Puppo, E. (2000) · Elsevier eBooks · doi:10.1016/b978-044482537-7/50008-5 · Cited by 85
An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
Edelsbrunner, H., Tan, T.-S., & Waupotitsch, R. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913058 · Cited by 82
Mesh generation for domains with small angles
Shewchuk, J. R. (2000) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/336154.336163 · Cited by 81
On the geodesic voronoi diagram of point sites in a simple polygon
Aronov, B. S. (1989) · Algorithmica · doi:10.1007/bf01553882 · Cited by 80
An improved incremental algorithm for constructing restricted Delaunay triangulations
Anglada, M. V. (1997) · Computers & Graphics · doi:10.1016/s0097-8493(96)00085-4 · Cited by 79
An upper bound for conforming Delaunay triangulations
Edelsbrunner, H., & Tan, T.-S. (1993) · Discrete & Computational Geometry · doi:10.1007/bf02573974 · Cited by 78
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
Wang, C.-P., & Schubert, L. K. (1987) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/41958.41982 · Cited by 76
Automatic mesh generation using the symmetric axis transformation of polygonal domains
Srinivasan, V., Nackman, L. R., Tang, J.-M., & Meshkat, S. N. (1992) · Proceedings of the IEEE · doi:10.1109/5.163413 · Cited by 73
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
Aggarwal, A., Guibas, L. J., Saxe, J. B., & Shor, P. W. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.28400 · Cited by 69
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
Shewchuk, J. R. (2000) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/336154.336222 · Cited by 68
3D boundary recovery by constrained Delaunay tetrahedralization
Si, H., & Gärtner, K. (2010) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.3016 · Cited by 65
Constrained Delaunay triangulation for multiresolution surface description
Floriani, L. D., & Puppo, E. (2003) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1988.28293 · Cited by 63
Geometric Data Structures for Computer Graphics
Langetepe, E., & Zachmann, G. (2006) · A K Peters/CRC Press eBooks · doi:10.1201/9780367803735 · Cited by 63
Bern, M. W., Eppstein, D., & Gilbert, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89542 · Cited by 62
Pepe, A., Euillades, L., Manunta, M., & Lanari, R. (2011) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2135371 · Cited by 57
Chin, F. Y. L., & Wang, C. A. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795285916 · Cited by 55
Zhu, J., Li, X., Jin, P., Xu, Q., Sun, Z., & Song, X. (2020) · Sensors · doi:10.3390/s21010027 · Cited by 51
“Interpolation operation: Delaunay tria gul tion (DT) algorithm [25] and Voronoi diagram are introduced to fill in the sparse depth-map and height-map.”
MethodUpdating and constructing constrained delaunay and constrained regular triangulations by flips
Shewchuk, J. R. (2003) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/777792.777821 · Cited by 51
Reprint of: Delaunay refinement algorithms for triangular mesh generation
Shewchuk, J. R. (2014) · Computational Geometry · doi:10.1016/j.comgeo.2014.02.005 · Cited by 48
Shewchuk, J. R. (1999) · Cited by 47
UrbanEvolver: Function-Aware Urban Layout Regeneration
Qin, Y., Zhao, N., Yang, J., Pan, S., Sheng, B., & Lau, R. W. H. (2024) · International Journal of Computer Vision · doi:10.1007/s11263-024-02030-w · Cited by 46
Papadopoulou, E., & Lee, D. T. (1998) · Algorithmica · doi:10.1007/pl00009199 · Cited by 46
Self-citationNode‐by‐node parallel finite elements: a virtually meshless method
YAGAWA, G. (2004) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.955 · Cited by 44
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
Aichholzer, O., Aurenhammer, F., Krasser, H., & Braß, P. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702411368 · Cited by 44
Topology design for free space optical networks
Gurumohan, P. C., & Hui, J. (2004) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2003.1284227 · Cited by 44
Simultaneous curve simplification
Dyken, C., Dæhlen, M., & Sevaldrud, T. (2009) · Journal of Geographical Systems · doi:10.1007/s10109-009-0078-8 · Cited by 43
Three Dimensional Boundary Conforming Delaunay Mesh Generation
Si, H. (2008) · DepositOnce · doi:10.14279/depositonce-4807 · Cited by 43
Three-dimensional constrained boundary recovery with an enhanced Steiner point suppression procedure
Chen, J., Zhao, D., Huang, Z., Zheng, Y., & Gao, S. (2011) · Computers & Structures · doi:10.1016/j.compstruc.2010.11.016 · Cited by 41
Nodal-based discontinuous deformation analysis
Bao, H. R. (2010) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/41757 · Cited by 41
A convex polygon among polygonal obstacles: placement and high-clearance motion
Chew, L. P., & Kedem, K. (1993) · Computational Geometry · doi:10.1016/0925-7721(93)90001-m · Cited by 40
On the geodesic Voronoi diagram of point sites in a simple polygon
Aronov, B. S. (1987) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/41958.41963 · Cited by 39
Computing 2D Constrained Delaunay Triangulation Using the GPU
Qi, M., Cao, T.-T., & Tan, T.-S. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.307 · Cited by 38
Robust Image Fingerprinting Based on Feature Point Relationship Mining
Nie, X., Li, X., Chai, Y., Cui, C., Xi, X., & Yin, Y. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2790953 · Cited by 38
Meshing of domains with complex internal geometries
Holm, R., Kaufmann, R., Heimsund, B., Øian, E., & Espedal, M. S. (2006) · Numerical Linear Algebra with Applications · doi:10.1002/nla.505 · Cited by 36
Sequences of spanning trees and a fixed tree theorem
Aichholzer, O., Aurenhammer, F., & Hurtado, F. (2002) · Computational Geometry · doi:10.1016/s0925-7721(01)00042-6 · Cited by 35
POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
Bern, M. W., & Eppstein, D. (1992) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195992000159 · Cited by 35
Parallel computing of high‐speed compressible flows using a node‐based finite‐element method
FUJISAWA, T., Inaba, M., & YAGAWA, G. (2003) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.788 · Cited by 33
Melissaratos, E. A., & Souvaine, D. L. (1992) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/142675.142719 · Cited by 33
Walters, L. N., Zhang, C., Dravid, V. P., Poeppelmeier, K. R., & Rondinelli, J. M. (2021) · Chemistry of Materials · doi:10.1021/acs.chemmater.0c02682 · Cited by 32
Shewchuk, J. R. (2012) · Chapman & Hall/CRC computational science series/Chapman & Hall/CRC computational science · doi:10.1201/b11644-11 · Cited by 31
An O(n2log n) time algorithm for the MinMax angle triangulation
Edelsbrunner, H., Tan, T.-S., & Waupotitsch, R. (1990) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/98524.98535 · Cited by 30
Representing stereo data with the Delaunay triangulation
Boissonnat, J. D., Faugeras, O. D., & Bras-Mehlman, E. L. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1988.12326 · Cited by 30
Placing the largest similar copy of a convex polygon among polygonal obstacles
Chew, L. P., & Kedem, K. (1989) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73833.73853 · Cited by 30
Semantically correct 2.5D GIS data — The integration of a DTM and topographic vector data
Koch, A., & Heipke, C. (2006) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2006.07.005 · Cited by 29
Si, H., & Shewchuk, J. R. (2013) · Engineering With Computers · doi:10.1007/s00366-013-0331-0 · Cited by 29
Voronoi diagrams with barriers and the shortest diagonal problem
Lingas, A. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90043-4 · Cited by 29
Molecular dynamics-based unstructured grid generation method for aerodynamic applications
Zheleznyakova, A. L., & Суржиков, С. Т. (2013) · Computer Physics Communications · doi:10.1016/j.cpc.2013.07.013 · Cited by 28
A Strategy for Self-Organized Coordinated Motion of a Swarm of Minimalist Robots
Shirazi, A. R., & Jin, Y. (2017) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2017.2741505 · Cited by 28
Fast greedy triangulation algorithms
Dickerson, M. T., Drysdale, R. L. S., McElfresh, S. A., & Welzl, E. (1994) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/177424.177649 · Cited by 28
Reliable Delaunay‐based mesh generation and mesh improvement
Boender, E. (1994) · Communications in Numerical Methods in Engineering · doi:10.1002/cnm.1640101003 · Cited by 28
Computing 2D constrained Delaunay triangulation using the GPU
Qi, M., Cao, T.-T., & Tan, T.-S. (2012) · ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D) · doi:10.1145/2159616.2159623 · Cited by 27
Constrained Delaunay Tetrahedrization: A Robust and Practical Approach
Diazzi, L., Panozzo, D., Vaxman, A., & Attene, M. (2023) · ACM Transactions on Graphics · doi:10.1145/3618352 · Cited by 27
Detecting and decomposing self-overlapping curves
Shor, P. W., & Wyk, C. J. V. (1992) · Computational Geometry · doi:10.1016/0925-7721(92)90019-o · Cited by 26
Comparison of existing triangulation methods for regularly and irregularly spaced height fields
Wang, K., Lo, C., Brook, G. A., & Arabnia, H. R. (2001) · International Journal of Geographical Information Systems · doi:10.1080/13658810110074492 · Cited by 25
A review of methodologies for path planning and optimization of mobile robots
Sahoo, S. K., & Choudhury, B. B. (2023) · Journal of Process Management New Technologies · doi:10.5937/jouproman2301122s · Cited by 24
Summary on Several Key Techniques in 3D Geological Modeling
Mei, G. (2014) · The Scientific World JOURNAL · doi:10.1155/2014/723832 · Cited by 23
An algorithm for filling complex holes in reverse engineering
Li, G., Ye, X., & Zhang, S. (2007) · Engineering With Computers · doi:10.1007/s00366-007-0075-9 · Cited by 23
A novel topology control for multihop packet radio networks
Hu, L. (1991) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1991.147624 · Cited by 23
A variational formulation of the fast marching eikonal solver
Fomel, S. B. (2000) · Cited by 22
Fast segment insertion and incremental construction of constrained Delaunay triangulations
Shewchuk, J. R., & Brown, B. C. (2015) · Computational Geometry · doi:10.1016/j.comgeo.2015.04.006 · Cited by 22
Li, Y., Yue, J., Niu, R., & Liu, G. R. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.05.012 · Cited by 22
On computing the voronoi diagram for restricted planar figures
Djidjev, H. N., & Lingas, A. (2005) · Springer eBooks · doi:10.1007/bfb0028250 · Cited by 22
Fast algorithms for greedy triangulation
Levcopoulos, C., & Lingas, A. (1992) · BIT Numerical Mathematics · doi:10.1007/bf01994882 · Cited by 22
Fazzi, L., & Groves, R. M. (2020) · Measurement · doi:10.1016/j.measurement.2020.108197 · Cited by 21
Sapidis, N. S., & Perucchio, R. (1991) · ACM Symposium on Solid Modeling and Applications · doi:10.1145/112515.112581 · Cited by 21
3D Topography. A Simplicial Complex-based Solution in a Spatial DBMS
Penninga, F. (2008) · Publications on geodesy. New series · doi:10.54419/6fb987 · Cited by 20
Optimal time bounds for some proximity problems in the plane
Aggarwal, A., Edelsbrunner, H., Raghavan, P., & Tiwari, P. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90133-g · Cited by 20
An upper bound for conforming Delaunay triangulations
Edelsbrunner, H., & Tan, T.-S. (1992) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/142675.142690 · Cited by 20
ON THE POSITIONAL ENHANCEMENT OF DIGITAL CADASTRAL MAPS
Felus, Y. A. (2007) · Survey Review · doi:10.1179/175227007x197183 · Cited by 19
On good triangulations in three dimensions
Dey, T. K., Bajaj, C. L., & Sugihara, K. (1991) · ACM Symposium on Solid Modeling and Applications · doi:10.1145/112515.112578 · Cited by 19
Metadata
- Authors
- Lee, D. T., & Lin, A. K.
- Affiliations
- Northwestern University (US)
- ORCID
- Lin, A. K.
- Venue
- Discrete & Computational Geometry
- Published
- 1986-09
- Volume
- 1
- Issue
- 3
- Pages
- 201-217
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W2004988621
- Cited by
- 286
- References
- 27
- Citations by year
- 2026: 9 · 2025: 9 · 2024: 5 · 2023: 8 · 2022: 5 · 2021: 6 · 2020: 12 · 2019: 4 · 2018: 7 · 2017: 7 · 2016: 8 · 2015: 5 · 2014: 6 · 2013: 7 · 2012: 6
- FWCI
- 5.60
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Discrete & Computational Geometry (publishedVersion)
- Funders
- National Science Foundation (8420814)
- 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 › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Keywords
- planar straight-line graphs, triangulation, triangulation algorithms, simple polygons, divide-and-conquer, 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.
