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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalized delaunay triangulation for planar graphs. https://app.cochat.ai/papers/10.1007/bf02187695
- The paper
- Lee, D. T., & Lin, A. K. (1986). Generalized delaunay triangulation for planar graphs. Discrete & Computational Geometry. https://doi.org/10.1007/bf02187695
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.
