References
- Anglada, M. V. An Improved Incremental Algorithm for Constructing Restricted Delaunay Triangulations.
- Bern, M. Edge Insertion for Optimal Triangulations.
- Chew, L. P. Constrained Delaunay Triangulations.
- Eberly, D. H. Triangulation by Ear Clipping.
- Devillers, O. Walking in a Triangulation.
- Deymen, M. Efficient Triangulation-Based Pathfinding.
- Guibas, L. J., & Stolfi, J. Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams.
- Kallmann, M. Fully Dynamic Constrained Delaunay Triangulations.
- Kallmann, M. Path Planning in Triangulations.
- Kallmann, M. Star Vertices: A Simple Approach for Fast Point Location in Triangulations.
- Knuth, D. E. The Art of Computer Programming, Volume 1: Fundamental Algorithms.
- Lawson, C. L. Software for C1 Surface Interpolation.
- Held, M. An Engineering Approach to the Reliable and Efficient Computation of Voronoi Diagrams of Points and Line Segments.
- Mäntylä, M. An Introduction to Solid Modeling.
- Mücke, E. P., Saias, I., & Zhu, B. Fast Randomized Point Location Without Preprocessing in Two- and Three-Dimensional Delaunay Triangulations.
- Devillers, O. On Deletion in Delaunay Triangulations.
- Shewchuk, J. R. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates.
- Shewchuk, J. R. Engineering a 2D Quality Mesh Generator and Delaunay Triangulator.
- Shewchuk, J. R. Fast Segment Insertion and Incremental Construction of Constrained Delaunay Triangulations.
- Sloan, S. W. A Fast Algorithm for Constructing Delaunay Triangulations in the Plane.
- Sloan, S. W. A Fast Algorithm for Generating Constrained Delaunay Triangulations.
- Goodman, J. E., O’Rourke, J., & Tóth, C. D. (Eds.). Handbook of Discrete and Computational Geometry (3rd ed.).