Cited by 292Computational Geometry and Mesh GenerationComplexity and Algorithms in GraphsAdvanced Combinatorial Mathematics

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 access

Lee, D. T., Lin, A. K.·1986·Discrete & Computational Geometry

DOI 10.1007/bf02187695

Open this paper in CoChat — free account Open PDF

Integrity signals

Registry

Crossref · 10.1007/bf02187695

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Computational Geometry
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-citation
Closest-point problems
Shamos, 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

Show all 27 references

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.

Items 101–200 of 292

A sonar point cloud driven method for underwater steel structure defects inspection
Yan, J., Zhu, Y., Xiong, W., Cai, C. S. S., & Zhang, J. (2025) · Ocean Engineering · doi:10.1016/j.oceaneng.2025.120770 · Cited by 18
A FAST APPROACH FOR STITCHING OF AERIAL IMAGES
Moussa, A., & El‐Sheimy, N. (2016) · The international archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences · doi:10.5194/isprsarchives-xli-b3-769-2016 · Cited by 18
Fast greedy triangulation algorithms
Dickerson, M. T., Drysdale, R. L. S., McElfresh, S. A., & Welzl, E. (1997) · Computational Geometry · doi:10.1016/s0925-7721(97)89149-3 · Cited by 18
Estimation of the residual bearing strength of corroded bridge girders using 3D scan data
Zhang, T., & Zaghi, A. E. (2023) · Thin-Walled Structures · doi:10.1016/j.tws.2023.110798 · Cited by 17
A Simple Linear Time Greedy Triangulation Algorithm for Uniformly Distributed Points
Aichholzer, O., Drysdale, R., & Rote, G. (1995) · Cited by 17
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
Klein, R., & Lingas, A. (1993) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/160985.161008 · Cited by 17
Pointed binary encompassing trees: Simple and optimal
Hoffmann, M., Speckmann, B., & Tóth, C. D. (2009) · Computational Geometry · doi:10.1016/j.comgeo.2006.12.005 · Cited by 16
Generating seamless surfaces for transport and dispersion modeling in GIS
Camelli, F. E., Lien, J., Shen, D., Wong, D. W. S., Rice, M. T., Löhner, R., & Yang, C. P. (2011) · GeoInformatica · doi:10.1007/s10707-011-0138-3 · Cited by 16
Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane
Su, T.-H., & Chang, R. (1991) · Pattern Recognition · doi:10.1016/0031-3203(91)90064-c · Cited by 16
Algorithm and data structure for triangulating multiply connected polygonal domains
Piegl, L. A., & Richard, A. M. (1993) · Computers & Graphics · doi:10.1016/0097-8493(93)90007-v · Cited by 16
Bridge protection algorithms – A technique for fault-tolerance in sensor networks
Khan, S. A., Bölöni, L. L., & Turgut, D. (2014) · Ad Hoc Networks · doi:10.1016/j.adhoc.2014.08.016 · Cited by 15
Deterministic Linear Time Constrained Triangulation Using Simplified Earcut
Livesu, M., Cherchi, G., Scateni, R., & Attene, M. (2021) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2021.3070046 · Cited by 15
Duality of constrained Voronoi diagrams and Delaunay triangulations
Joe, B., & Wang, C. A. (1993) · Algorithmica · doi:10.1007/bf01188709 · Cited by 15
Polynomial-size nonobtuse triangulation of polygons
Bern, M. W., & Eppstein, D. (1991) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/109648.109686 · Cited by 15
Algorithm for constrained delaunay triangulation
Fang, T.-P., & Piegl, L. A. (1994) · The Visual Computer · doi:10.1007/bf01901582 · Cited by 14
Proximity Search with a Triangulated Spatial Model
Jones, C. B. (1998) · The Computer Journal · doi:10.1093/comjnl/41.2.71 · Cited by 14
Fast algorithms for greedy triangulation
Levcopoulos, C., & Lingas, A. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52846-6_93 · Cited by 14
Geometric data structures for computer graphics
(2006) · Choice Reviews Online · doi:10.5860/choice.44-0357 · Cited by 14
Counting Plane Graphs with Exponential Speed-Up
Razen, A., & Welzl, E. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19391-0_3 · Cited by 13
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
Yang, Y., Yong, J., & Sun, J. (2005) · Computers & Graphics · doi:10.1016/j.cag.2005.05.011 · Cited by 13
Enhanced Delaunay Triangulation Sea Ice Tracking Algorithm with Combining Feature Tracking and Pattern Matching
Zhang, M., An, J., Zhang, J., Yu, D., Wang, J., & Lv, X. (2020) · Remote Sensing · doi:10.3390/rs12030581 · Cited by 12
Simulation of Permeation of Saturated Cement Paste Based on a New Meso-scale Pore Network Model
Zhou, Y. J., Yang, Y., Gyawali, B., & Zhang, W. (2021) · International Journal of Concrete Structures and Materials · doi:10.1186/s40069-021-00468-7 · Cited by 12
Triangulated spatial models and neighbourhood search: an experimental comparison with quadtrees
Jones, C. B., Ware, J. M., & Eynon, C. D. (1999) · The Visual Computer · doi:10.1007/s003710050175 · Cited by 12
A robust efficient tracing scheme for triangulating trimmed parametric surfaces
Cripps, R. J., & Parwana, S. S. (2010) · Computer-Aided Design · doi:10.1016/j.cad.2010.08.009 · Cited by 12
Incremental tessellation of trimmed parametric surfaces
Ng, W. M. M., & Tan, S. T. (2000) · Computer-Aided Design · doi:10.1016/s0010-4485(99)00089-5 · Cited by 12
A space efficient greedy triangulation algorithm
Goldman, S. A. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90122-1 · Cited by 12
How the Delaunay Triangulation Can Be used For Representing Stereo Data
Bras-Mehlman, E. L., Schmitt, M., Faugeras, O. D., & Boissonnat, J. D. (2005) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/ccv.1988.589971 · Cited by 12
Forest-like abstract Voronoi diagrams in linear time
Bohler, C., Klein, R., Lingas, A., & Liu, C.-H. (2017) · Computational Geometry · doi:10.1016/j.comgeo.2017.06.013 · Cited by 11
3D Reconstruction and Visualization of Alternatives for Restoration of Historic Buildings - A New Approach
Ragia, L., Sarri, F., & Mania, K. (2015) · International Conference on Geographical Information Systems Theory, Applications and Management (GISTAM) · doi:10.5220/0005376700940102 · Cited by 11
Top-Down Approach to Retention Time Prediction in Comprehensive Two-Dimensional Gas Chromatography–Mass Spectrometry
Gaida, M., Franchina, F. A., Stefanuto, P., & Focant, J. (2022) · Analytical Chemistry · doi:10.1021/acs.analchem.2c03107 · Cited by 11
Dynamic mesh refinement
Miller, G. L., & Hudson, B. (2007) · Cited by 11
Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations
Schulz, A. (2008) · Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver · doi:10.17169/refubium-16284 · Cited by 11
MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION
Devillers, O., Estkowski, R., Gandoin, P.-M., Hurtado, F., Ramos, P. A., & Sacristán, V. (2003) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195903001244 · Cited by 10
An Iterative Algorithm for Generating Constrained Voronoi Grids
Katzmayr, M., & Ganzer, L. (2009) · SPE Reservoir Simulation Conference · doi:10.2118/118942-ms · Cited by 10
Delaunay–Voronoï Methods
Baker, T. J. (1998) · CRC Press eBooks · doi:10.1201/9781420050349.ch16 · Cited by 10
Applying time series interferometric synthetic aperture radar and the unscented Kalman filter to predict deformations in Maoxian landslide
Xue, F., & Lv, X. (2019) · Journal of Applied Remote Sensing · doi:10.1117/1.jrs.13.014509 · Cited by 10
A computerized crop-specific drought monitoring system: Design concepts and initial testing
Lourens, U. W., & de Jager, J. M. (1997) · Agricultural Systems · doi:10.1016/s0308-521x(96)00004-2 · Cited by 10
Efficiently updating constrained Delaunay triangulations
Wang, C. A. (1993) · BIT Numerical Mathematics · doi:10.1007/bf01989747 · Cited by 10
A numerical stable algorithm for constructing constrained Delaunay triangulation and application to multichip module layout
Lu, Y., & Dai, W. (2002) · doi:10.1109/ciccas.1991.184439 · Cited by 10
Delaunay Triangulation-Based Features for Camera-Based Document Image Retrieval System
Dang, Q. B., Rusiñol, M., Coustaty, M., Luqman, M. M., Tran, C. D., & Ogier, J.-M. (2016) · IAPR International Workshop on Document Analysis Systems (DAS) · doi:10.1109/das.2016.66 · Cited by 9
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
Papadopoulou, E., & Lee, D. T. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60313-1_147 · Cited by 9
Self-citation
Vertex-Colored Encompassing Graphs
Hoffmann, M., & Tóth, C. D. (2013) · Graphs and Combinatorics · doi:10.1007/s00373-013-1320-1 · Cited by 9
Graph-Based Compression for Distributed Particle Filters
Yu, J. Y., Coates, M., & Rabbat, M. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2018.2890231 · Cited by 9
A Survey of Constrained Delaunay Triangulation Algorithms for Surface Representation
Floriani, L. D., & Puppo, E. (1989) · Springer eBooks · doi:10.1007/978-3-7091-2830-5_7 · Cited by 9
Approximating uniform triangular meshes in polygons
Aurenhammer, F., Katoh, N., Kojima, H., Ohsaki, M., & Xu, Y. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00407-8 · Cited by 9
Compressing TINs
Floriani, L. D., Magillo, P., & Puppo, E. (1998) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/288692.288718 · Cited by 9
A space efficient algorithm for the greedy triangulation
Lingas, A. (2006) · Springer eBooks · doi:10.1007/bfb0042804 · Cited by 9
Applying two-dimensional delaunay triangulation to stereo data interpolation
Bruzzone, E., Cazzanti, M., Floriani, L. D., & Mangili, F. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55426-2_41 · Cited by 9
Graph-based spatial co-location pattern mining: integrate geospatial analysis and logical reasoning
Wang, J., Ai, T., Wu, H., Xu, H., Xiao, T., & Li, G. (2024) · International Journal of Digital Earth · doi:10.1080/17538947.2024.2390434 · Cited by 8
From point patterns to networks: to what extent does the Delaunay triangulation reproduce key spatial and density information?
Newby, E., Shi, W., Jiao, Y., Salvatore Torquato, A., & Albert, R. (2025) · Journal of Complex Networks · doi:10.1093/comnet/cnaf040 · Cited by 8
Directed Self-Assembly in Diblock Copolymer Thin Films for Uniform Hemisphere Pattern Formation
Hill, J. D., & Millett, P. C. (2019) · Macromolecules · doi:10.1021/acs.macromol.9b01545 · Cited by 8
A 3D Surface Reconstruction Method for Large-Scale Point Cloud Data
Guo, B., Wang, J., Jiang, X., Li, C., Su, B., Cui, Z., Sun, Y., & Chang-lei, Y. (2020) · Mathematical Problems in Engineering · doi:10.1155/2020/8670151 · Cited by 8
On triangulation axes of polygons
Aigner, W., Aurenhammer, F., & Bert Jüttler, B. (2014) · Information Processing Letters · doi:10.1016/j.ipl.2014.08.006 · Cited by 8
Pointed and colored binary encompassing trees
Hoffmann, M., & Tóth, C. D. (2005) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1064092.1064107 · Cited by 8
Free Mesh Method: fundamental conception, algorithms and accuracy study
YAGAWA, G. (2011) · Proceedings of the Japan Academy Series B · doi:10.2183/pjab.87.115 · Cited by 8
An optimal mesh computer algorithm for constrained Delaunay triangulation
Guha, S. (2002) · International Parallel Processing Symposium · doi:10.1109/ipps.1994.288190 · Cited by 8
A framework for advancing front techniques of finite element mesh generation
Farestam, S., & Simpson, R. B. (1995) · BIT Numerical Mathematics · doi:10.1007/bf01737163 · Cited by 8
Integral ear elimination and virtual point-based updating algorithms for constrained Delaunay TIN
Wu, L., Wang, Y., & Shi, W. (2008) · Science China Technological Sciences · doi:10.1007/s11431-008-5018-1 · Cited by 8
Fast skeleton construction
Klein, R., & Lingas, A. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60313-1_172 · Cited by 8
3D Modeling of elevation surfaces from voxel structured point clouds extracted from seismic cubes
Nguyen, V. S. (2013) · theses.fr (ABES) · doi:10.70675/9dcbf59ezd8b6z4d6dz8dbez31184b3e68cb · Cited by 8
Molecular dynamics simulations of ion adsorption on biphasic calcium phosphate surfaces: Effects of ionic environment and surface morphology
Zhang, Q., Wang, X., & Xu, D. (2024) · Applied Surface Science · doi:10.1016/j.apsusc.2024.162262 · Cited by 7
Cecelia: a multifunctional image analysis toolbox for decoding spatial cellular interactions and behaviour
Schienstock, D., Hor, J. L., Devi, S., & Mueller, S. N. (2025) · Nature Communications · doi:10.1038/s41467-025-57193-y · Cited by 7
Triangulations of Line Segment Sets in the Plane
Brévilliers, M., Chevallier, N., & Schmitt, D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77050-3_32 · Cited by 7
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/jpmnt11-45039 · Cited by 7
Computing the minimum visible vertex distance between two polygons
Aggarwal, A., Moran, S., Shor, P. W., & Suri, S. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51542-9_11 · Cited by 7
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Wang, C. A., & Chin, F. Y. L. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60313-1_150 · Cited by 7
Adaptive Range Data Approximation by Constrained Surface Triangulation
Chen, X., & Schmitt, F. (1993) · Springer eBooks · doi:10.1007/978-3-642-78114-8_6 · Cited by 7
Evaluation of a Delaunay-based method for surface approximation
Fjällström, P.-O. (1993) · Computer-Aided Design · doi:10.1016/0010-4485(93)90012-d · Cited by 7
Inserting line segments into triangulations and tetrahedralizations
Bernal, J. (1995) · doi:10.6028/nist.ir.5596 · Cited by 7
An ANN-based advancing double-front method for automatic isotropic triangle generation
Lu, P., Wang, N., Chang, X., Zhang, L., Wu, Y., & Zhang, H. (2022) · Scientific Reports · doi:10.1038/s41598-022-16946-1 · Cited by 6
Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain
Klein, R. (1997) · Springer eBooks · doi:10.1007/978-3-642-60718-9_22 · Cited by 6
Precise photorealistic visualization for restoration of historic buildings based on tacheometry data
Ragia, L., Sarri, F., & Mania, K. (2018) · Journal of Geographical Systems · doi:10.1007/s10109-018-0267-4 · Cited by 6
Directing the Diffusion of a Nonmagnetic Nanosized Active Particle with External Magnetic Fields
Kaiser, M., Sánchez, P. A., Samanta, N., Chakrabarti, R., & Kantorovich, S. S. (2020) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.0c05791 · Cited by 6
Generating characteristic maps of battery cell parameters from sparse input data
Lenz, M., Mertes, S., Beecks, P.-J., Viertel, P., & Pischinger, S. (2021) · Journal of Power Sources · doi:10.1016/j.jpowsour.2021.230054 · Cited by 6
OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
Aronov, B. S., Asano, T., & Funke, S. (2010) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195910003219 · Cited by 6
Semantically Correct 2.5D GIS Data — the Integration of a DTM and Topographic Vector Data
Koch, A., & Heipke, C. (2006) · Springer eBooks · doi:10.1007/3-540-26772-7_39 · Cited by 6
Pre-triangulations and liftable complexes
Aichholzer, O., Aurenhammer, F., & Hackl, T. (2006) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1137856.1137899 · Cited by 6
Greedy triangulation approximates the optimum and can be implemented in linear time in the average case
Levcopoulos, C., & Lingas, A. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54029-6_163 · Cited by 6
Constrained Delaunay Triangulation Using Delaunay Visibility
Yang, Y., Zhang, H., Yong, J., Zeng, W., Paul, J., & Sun, J. (2006) · Lecture notes in computer science · doi:10.1007/11919476_68 · Cited by 5
The Dual is the Context: Spatial Structures for GIS
Gold, C. (2010) · International Symposium on Voronoi Diagrams in Science and Engineering · doi:10.1109/isvd.2010.9 · Cited by 5
Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations with Finite Precision Coordinates
Si, H., & Shewchuk, J. R. (2012) · Springer eBooks · doi:10.1007/978-3-642-33573-0_11 · Cited by 5
Optimal Triangulations
Aurenhammer, F., & Xu, Y. (2008) · Springer eBooks · doi:10.1007/978-0-387-74759-0_475 · Cited by 5
A Study on Vector-Based Processing and Texture Application Techniques for 3D Object Creation and Visualization
Kang, D., Kim, J., Lee, J., Lee, H., Kim, J., & Byun, J.-W. (2025) · Applied Sciences · doi:10.3390/app15074011 · Cited by 4
Detecting and decomposing self-overlapping curves
Shor, P. W., & Wyk, C. J. V. (1989) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73833.73838 · Cited by 4
An Evaluation Model of Level of Detail Consistency of Geographical Features on Digital Maps
Liu, P., & Xiao, J. (2020) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi9060410 · Cited by 4
Geometric Biplane Graphs I: Maximal Graphs
García, A., Hurtado, F., Korman, M., Matos, I., Saumell, M., Silveira, R. I., Tejel, J., & Tóth, C. D. (2015) · Graphs and Combinatorics · doi:10.1007/s00373-015-1546-1 · Cited by 4
Reconstruction of volume boundary from layers by triangulation
Hirsch, B. E., Thoben, K., Sheng, X., & Joppe, M. (1997) · Journal of Manufacturing Systems · doi:10.1016/s0278-6125(97)89096-6 · Cited by 4
Fast segment insertion and incremental construction of constrained delaunay triangulations
Shewchuk, J. R., & Brown, B. C. (2013) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2462356.2462389 · Cited by 4
Essential Constraints of Edge-Constrained Proximity Graphs
Bose, P. K., Carufel, J.-L. D., Shaikhet, A., & Smid, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44543-4_5 · Cited by 4
Point placement algorithms for Delaunay triangulation of polygonal domains
Nackman, L. R., & Srinivasan, V. (1994) · Algorithmica · doi:10.1007/bf01377180 · Cited by 4
Large-scale and high-quality multi-view stereo
Vu, H. H. (2011) · theses.fr (ABES) · doi:10.70675/148211dbzca70z42b5z8bdez1b971c78d40f · Cited by 4
Spatial Interpolants for Warping
Müller, H., & Ruprecht, D. (1999) · Elsevier eBooks · doi:10.1016/b978-012692535-7/50088-4 · Cited by 4
Spatial embedding of pseudo-triangulations
Aichholzer, O., Aurenhammer, F., & Braay, P. (2003) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/777792.777816 · Cited by 4
Bibliographic notes on Voronoi diagrams
(1993) · doi:10.6028/nist.ir.5164 · Cited by 4
AN INTEGRATED SEMANTICALLY CORRECT 2,5 DIMENSIONAL OBJECT ORIENTED TIN
Koch, A. (2005) · Cited by 3
Unbiased Curvilinear Structure Extraction for Cartoon Images
Yang, P., & GuoZhao, W. (2011) · International Symposium on Voronoi Diagrams in Science and Engineering · doi:10.1109/isvd.2011.37 · Cited by 3
Geometric Method of Form Finding for Mesh Reflectors
Wang, L., Xiao, Y., Fu, K., & Zhao, Z. (2020) · AIAA Journal · doi:10.2514/1.j059387 · Cited by 3
Shortcut hulls: Vertex-restricted outer simplifications of polygons
Bonerath, A., Haunert, J., Mitchell, J. S. B., & Niedermann, B. (2023) · Computational Geometry · doi:10.1016/j.comgeo.2023.101983 · Cited by 3
Optimal Area Polygonization by Triangulation and Visibility Search
Lepagnot, J., Moalic, L., & Schmitt, D. (2022) · ACM Journal of Experimental Algorithmics · doi:10.1145/3503953 · Cited by 3
A Study on Delaunay Terminal Edge Method
Rivara, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-34958-7_31 · Cited by 3

Authors: Lee, D. T., & Lin, A. K.
Affiliations: Northwestern University (US)
ORCID: Lin, A. K.
Venue: Discrete & Computational Geometry
Publisher: Springer Science and Business Media LLC
Published: 1986-09
Volume: 1
Issue: 3
Pages: 201-217
ISSN: 0179-5376 (ISSN-L)
1432-0444
DOI: 10.1007/bf02187695
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.

Generalized delaunay triangulation for planar graphs

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Citations

Cites

Cited by

Related

Metadata

Record

About these checks

Data sources