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
Items 201–292 of 292
Automated point feature label placement using backtracking algorithm with an adjacent graph
Chen, Y., Wang, Z., & Liu, X. (2010) · International Conference on Geoinformatics · doi:10.1109/geoinformatics.2010.5567901 · Cited by 3
Node-based parallel computing of three-dimensional incompressible flows using the free mesh method
FUJISAWA, T., Ito, S., INABA, M., & YAGAWA, G. (2003) · Engineering Analysis with Boundary Elements · doi:10.1016/s0955-7997(03)00097-3 · Cited by 3
A note on visibility-constrained Voronoi diagrams
Aurenhammer, F., Su, B., Xu, Y.-F., & Zhu, B. (2014) · Discrete Applied Mathematics · doi:10.1016/j.dam.2014.04.009 · Cited by 3
Vertex Deletion for 3D Delaunay Triangulations
Buchin, K., Devillers, O., Mulzer, W. J. H., Schrijvers, O., & Shewchuk, J. R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40450-4_22 · Cited by 3
Local properties of geometric graphs
Cardinal, J., Collette, S., & Langerman, S. (2007) · Computational Geometry · doi:10.1016/j.comgeo.2007.05.011 · Cited by 3
Lee, D. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888215-c1 · Cited by 3
Self-citationEVALUATION OF LANDSLIDE VOLUME USING PHOTOGRAMMETRIC TECHNIQUES
Barbarella, M., Fazio, C., & Fiani, M. (2000) · ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences · Cited by 3
Generating Free‐Form Grid Truss Structures from 3D Scanned Point Clouds
Ding, H., Xu, X., & Luo, Y. (2017) · Mathematical Problems in Engineering · doi:10.1155/2017/5818627 · Cited by 3
C-sensitive triangulations approximate the minmax length triangulation
Levcopoulos, C., & Lingas, A. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56287-7_98 · Cited by 3
On recent advances in 2D Constrained Delaunay triangulation algorithmsPreprint
Gaur, P. K., & Bose, S. K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.05949 · Cited by 3
Hillebrecht, T., Weber, T., Alfert, J., & Schuster, C. (2025) · IEEE Transactions on Components Packaging and Manufacturing Technology · doi:10.1109/tcpmt.2025.3597840 · Cited by 2
Delaunay Triangulations with Predictions
Cabello, S., Chan, T. M., & Giannopoulos, P. (2026) · dCOBISS.SI Digital Repository · doi:10.4230/lipics.itcs.2026.31 · Cited by 2
The finite body triangulation: algorithms, subgraphs, homogeneity estimation and application
Carson, C. G., & LEVINE, J. S. (2016) · Journal of Microscopy · doi:10.1111/jmi.12388 · Cited by 2
Chi-Square Goodness of Fit Test for Bivariate Distributions in Polygonal Area
Kesemen, O., Tiryaki, B. K., & Uluyurt, T. (2018) · International Journal of Scientific and Technological Research · Cited by 2
TextGen3D: A Real-Time 3D-Mesh Generation with Intersecting Contours for Text
Dhiman, A., Agrawal, P. K., Bose, S. K., & Vandrotti, B. S. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-4136-8_17 · Cited by 2
A learning-based parallel geocomputation engine for heterogeneous spatial domain
Gao, F., Lü, W., Zhang, F., Gan, L., & Rong, F. (2025) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2025.2528964 · Cited by 2
Adaptive constrained mesh generation: part 2 - accommodation of constraints
Kwan, A. K. H., Leung, A. Y. T., & Ng, P. L. (2010) · The HKU Scholars Hub (University of Hong Kong) · Cited by 2
Multi-agent approach for on-demand transport problem in a city
Malas, A., Falou, M. E., Falou, S. E., Itmi, M., & Cardon, A. (2016) · International Conference on Electrical, Electronics, Computer Engineering and their Applications (EECEA) · doi:10.1109/eecea.2016.7470763 · Cited by 2
Essential Constraints of Edge-Constrained Proximity Graphs
Bose, P. K., Carufel, J.-L. D., Shaikhet, A., & Smid, M. (2017) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00422 · Cited by 2
Detecting Uncertain Boundary Algorithm using Constrained Delaunay Triangulation
Cho, S. H. (2014) · Journal of the Korean Society of Surveying Geodesy Photogrammetry and Cartography · doi:10.7848/ksgpc.2014.32.2.87 · Cited by 2
Triangulations with Circular Arcs
Aichholzer, O., Aigner, W., Aurenhammer, F., Dobiášová, K. Č., Bert Jüttler, B., & Rote, G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25878-7_29 · Cited by 2
An Interference-aware and Power Efficient Topology Control Algorithm for Wireless Multi-hop Networks
Chuanhe, H., Cheng, Y., Li, Y., Wen-ming, S., & Hao, Z. (2008) · IEEE International Conference on Pervasive Computing and Communications · doi:10.1109/percom.2008.118 · Cited by 2
Computing 2D Constrained Delaunay Triangulation Using Graphics Hardware
Qi, M., Cao, T.-T., & Tan, T.-S. (2011) · Cited by 2
A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
Si, H. (2019) · Lecture notes in computational science and engineering · doi:10.1007/978-3-030-23436-2_4 · Cited by 2
Dey, T. K. (1990) · Purdue e-Pubs (Purdue University System) · Cited by 2
Surfaces In An Object-Oriented Geometric Framework
Klein, R. (1995) · Springer eBooks · doi:10.1007/978-3-642-79210-6_11 · Cited by 2
Pre-Triangulations and Liftable Complexes
Aichholzer, O., Aurenhammer, F., & Hackl, T. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-9032-z · Cited by 2
Langetepe, E., & Zachmann, G. (2006) · A K Peters/CRC Press eBooks · doi:10.1201/9780367803735-7 · Cited by 2
Duan, Q. (2020) · theses.fr (ABES) · doi:10.70675/9079cc2az85e5z430dz9347z243742ed6ed9 · Cited by 2
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
van Renssen, A., Yuan, S., Sun, Y., & Wong, S. (2025) · Algorithmica · doi:10.1007/s00453-025-01308-w · Cited by 1
Pan, H., Gu, J. R., & Zhou, J. M. (2012) · Advanced materials research · doi:10.4028/www.scientific.net/amr.468-471.2749 · Cited by 1
A Constrained Delaunay Triangulation Algorithm Based on Incremental Points
Wu, B. C., Tang, A. P., & Wang, L. F. (2011) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.90-93.3277 · Cited by 1
Solving On-Demand Transport Problem through Negotiation
Malas, A., Falou, S. E., Falou, M. E., Itmi, M., & Cardon, A. (2016) · Summer Computer Simulation Conference · doi:10.22360/summersim.2016.scsc.032 · Cited by 1
On One Approach to the Estimation of a Triangular Element Degeneration in a Triangulation
Kriksin, Y. A., & Tishkin, V. F. (2023) · Doklady Mathematics · doi:10.1134/s106456242370076x · Cited by 1
A Hierarchical Cluster Tree Approach Leveraging Delaunay Triangulation
Avatavului, C., & Boiangiu, C.-A. (2023) · BRAIN BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE · doi:10.18662/brain/14.3/482 · Cited by 1
ON ONE APPROACH TO THE ASSESSMENT OF A TRIANGULAR ELEMENT DEGENERATION IN A TRIANGULATION
Kriksin, Y. A., & Tishkin, V. F. (2023) · Доклады Российской академии наук Математика информатика процессы управления · doi:10.31857/s2686954323600088 · Cited by 1
Hillebrecht, T., Weber, T., Alfert, J., & Schuster, C. (2025) · IEEE Workshop on Signal and Power Integrity · doi:10.1109/spi64682.2025.11014326 · Cited by 1
On the relationships among constrained geometric structures
Jennings, E. H., & Lingas, A. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56279-6_82 · Cited by 1
The construction of Delaunay diagrams by lob reduction
Kauffmann, P., & Spehner, J.-C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-47738-1_19 · Cited by 1
Construction de la triangulation de Delaunay de segments par un algorithme de flip
Brévilliers, M. (2008) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 1
A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE
FUJISAWA, T., & YAGAWA, G. (2004) · International Journal of Computational Methods · doi:10.1142/s0219876204000149 · Cited by 1
Pointed and Colored Binary Encompassing Trees
Homann, M. (2005) · Cited by 1
Delaunay triangulation based on nesting island with holes
Jian-min, W., & Zhang, M. (2010) · International Conference on Computer Application and System Modeling · doi:10.1109/iccasm.2010.5622336 · Cited by 1
Point deletion for dynamic update of CD-TIN
Li-xin, W., Yanbing, W., Wenzhong, S., & Xiaolin, J. (2005) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss.2005.1525248 · Cited by 1
Fast algorithms of constrained Delaunay triangulation and skeletonization for band images
Zeng, W., Yang, C., Meng, X., Yang, Y., & Xiu-kun, Y. (2004) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.532615 · Cited by 1
Crossing-Free Configurations on Planar Point Sets
Razen, A. (2009) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005902005 · Cited by 1
An incremental algorithm based on edge swapping for constructing restricted Delaunay triangulations
Anglada, M. V. (1995) · Cited by 1
Relaxing and lifting triangulations
Hackl, T. (2010) · TUGraz OPEN Library (Graz University of Technology) · doi:10.3217/wr0km-v1e13 · Cited by 1
Generalized Delaunay triangulations : graph-theoretic properties and algorithms
Cano, P. (2020) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-328194 · Cited by 1
Constrained Edges and Delaunay Triangulation
Dinas, S., & Martínez, H. J. (2024) · Springer eBooks · doi:10.1007/978-3-031-23161-2_394 · Cited by 1
Decompositions of Polyhedra in Thr ee Dimensions (Ph.D. Thesi s)
Dey, T. K. (1991) · Purdue e-Pubs (Purdue University System)
Optimal Triangulation with Steiner Points
Aronov, B. S., Asano, T., & Funke, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77120-3_59
Digital Images in Support of Historical Building Data Bases
Barbarella, M., & Fiani, M. (1996) · Springer eBooks · doi:10.1007/978-3-7091-2684-4_10
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
Chin, F. Y. L., Lee, D. T., & Wang, C. A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48447-7_24
Self-citationBody-fitting Meshes for the Discontinuous Galerkin Method
Cui, J. G. (2013) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00003541
A novel vector quantizer for pattern classification tasks
Prasad, V. S. N., Yegnanarayana, B., & Guruprasad, S. (2004) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2003.1223418
Meshing piecewise smooth complexes
Cheng, S.-W., Dey, T. K., & Shewchuk, J. R. (2013) · Chapman & Hall/CRC eBooks · doi:10.1201/b12987-17
Geometrical Mesh Improvement Properties of Delaunay Terminal Edge Renement A Progress Report
Simpson, B., & Rivara, M. (2006)
A linear-time construction of the relative neighborhood graph within a histogram
Lingas, A., & Mukhopadhyay, A. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60220-8_65
Graphics Spatial Conflict Detection Based on the Constrained Delaunay Triangulation
Chen, Y., Wang, Z., & Liu, X. (2009) · International Congress on Image and Signal Processing (CISP) · doi:10.1109/cisp.2009.5304711
Path planning in a 3D environment created using real world data
Kurt, G., & İnce, G. (2015) · Signal Processing and Communications Applications Conference (SIU) · doi:10.1109/siu.2015.7129842
A stochastic approach to modeling surface wildfire propagation
Hajian, M. (2016) · Digital Repository Service (Northeastern University) · doi:10.17760/d20211470
Reconstruction Based on Visibility
Shaikhet, A. (2017) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2017-12201
Bo, L., Zhao, G. L., Wang, W., & Du, X. (2018) · MATEC Web of Conferences · doi:10.1051/matecconf/201817503067
Cooperative Target Observation Moving Over a Planar Graph using a Modified Hill Climbing Search
Levi, P. A., & Jose, E. (2020) · International Journal of Computer Applications · doi:10.5120/ijca2020920134
Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms
Vila, M. D. P. C. (2020) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2020-14152
Near-Delaunay MetricsPreprint
van Beusekom, N., Buchin, K., Koerts, H., Meulemans, W., Rodatz, B., & Speckmann, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.11621
On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points
Si, H. (2021) · Lecture notes in computational science and engineering · doi:10.1007/978-3-030-76798-3_6
(2006) · A K Peters/CRC Press eBooks · doi:10.1201/b10626-12
Constrained Edges and Delaunay Triangulation
Dinas, S., & Martínez, H. J. (2020) · Springer eBooks · doi:10.1007/978-3-319-08234-9_394-1
Liseikin, V. D. (2017) · Scientific computation · doi:10.1007/978-3-319-57846-0_12
Frey, P. J., & George, P. (2008) · Wiley eBooks · doi:10.1002/9780470611166.biblio
Geometric Modelling and Spatial Reasoning
(1997) · Elsevier eBooks · doi:10.1016/b978-012444816-2/50011-3
梁, 艳. (2018) · Geomatics Science and Technology · doi:10.12677/gst.2018.62009
On Solving Fingerprint Cryptography Using Heptagonal Fuzzy Numbers and Cipher
Kavitha, S. N., & Selvakumari, K. (2024) · International Conference on Science Technology Engineering and Mathematics (ICONSTEM) · doi:10.1109/iconstem60960.2024.10568701
Towards greater selectivity and peak capacities in multidimensional separations of complex samples
Roca, L. S. (2022) · UvA-DARE (University of Amsterdam)
MACHINE VISION-BASED AREA CALCULATION METHOD FOR LASER CLADDING REGIONS ON ROTARY TILLER BLADES
Yifan, H. O. U., Juan, F. E. N. G., Hao, B. A. I., Siying, L. I. U., & Hongling, J. I. N. (2025) · INMATEH Agricultural Engineering · doi:10.35633/inmateh-77-67
Delaunay Triangulations with Predictions
Cabello, S., Chan, T. M., & Giannopoulos, P. (2026) · Repository of the University of Ljubljana (University of Ljubljana) · doi:10.48550/arxiv.2601.08106
Si, Q., Wan, B., Zhang, Z., Wang, Y., Xie, Q., & Zhang, X. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6126578
Optimal Triangulation of Polygons
Bishop, C. J. (2026) · Discrete & Computational Geometry · doi:10.1007/s00454-026-00831-z
Contributions à la résolution du transport à la demande fondées sur les systèmes multi-agents
Malas, A. (2017) · theses.fr (ABES) · doi:10.70675/3b41e104z86ebz4cf5z8e24z3f13e4bd74a4
Information spotting in huge repositories of scanned document images
Dang, Q. B. (2018) · theses.fr (ABES) · doi:10.70675/d9a93682zd073z418ezb206zc86271d3c82c
Wan, B., Si, Q., Zhang, Z., Wang, Y., Xie, Q., & Zhang, X. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6532969
On Gaussian filtering of scattered point clouds for surface metrology
Lifton, J. J. (2026) · Surface Topography Metrology and Properties · doi:10.1088/2051-672x/ae6ba0
Robust Constrained Tetrahedralization with Steiner-point-free Boundaries
Wang, Y., Yu, K., Ni, H., Wang, B., Si, H., & Chen, J. (2026) · ACM Transactions on Graphics · doi:10.1145/3829358
gCDT: A Highly Parallel GPU Algorithm for Large-Scale Constrained Delaunay Triangulation
Fan, P., Tang, M., Tong, R., He, L., Du, P., & Li, H. (2026) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/3799902.3811042
Enhancing PET/CT Radiomics Robustness Through Graph Signal Processing
Latino, T., Stefano, A., Pasini, G., Marinozzi, F., Russo, G. I., & Bini, F. (2026) · Diagnostics · doi:10.3390/diagnostics16142284
Graph Signal Processing as an Experimental Approach to Radiomics Analysis
Stefano, A., Latino, T., Pasini, G., Finti, A., Lauciello, N., Marinozzi, F., Russo, G. I., & Bini, F. (2026) · ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB) · doi:10.1145/3807503.3819357
Wan, B., Si, Q., Zhang, Z., Wang, Y., Xie, Q., & Zhang, X. (2026) · Case Studies in Thermal Engineering · doi:10.1016/j.csite.2026.108646
MULTIPLE-VIEWPOINT IMAGE STITCHING
Chan, K.-C., & Moon, Y.-S. (2010) · International Conference on Computer Vision Theory and Applications · doi:10.5220/0002893401900193
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.