Self-adjusting binary search trees
Journal of the ACM (JACM)
A fast algorithm for constructing Delaunay triangulations in the plane
Advances in Engineering Software
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Optimality of the Delaunay triangulation in Rd
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Construction of three-dimensional Delaunay triangulations using local transformations
Computer Aided Geometric Design
Hierarchical triangulation using cartographic coherence
CVGIP: Graphical Models and Image Processing
Journal of Computational Physics
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Construction of K-dimensional Delaunay triangulations using local transformations
SIAM Journal on Scientific Computing
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the twelfth annual symposium on Computational geometry
The 4-triangles longest-side partition of triangles and linear refinement algorithms
Mathematics of Computation
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Sink-insertion for mesh improvement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Geometry and topology for mesh generation
Geometry and topology for mesh generation
Computer Vision
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
A Hierarchical Triangle-Based Model for Terrain Description
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
Automatic extraction of Irregular Network digital terrain models
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Computational geometry.
Delaunay refinement mesh generation
Delaunay refinement mesh generation
A time-optimal delaunay refinement algorithm in two dimensions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Triangulations with locally optimal Steiner points
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Computational Geometry: Theory and Applications
Local refinement based on the 7-triangle longest-edge partition
Mathematics and Computers in Simulation
Quality Triangulations with Locally Optimal Steiner Points
SIAM Journal on Scientific Computing
Lepp terminal centroid method for quality triangulation
Computer-Aided Design
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Delaunay refinement is a technique for generating triangulations. Triangulations produced by algorithms in this class of techniques guarantee bounds on angles, edge lengths, the number and the grading of triangles in theory and practice. This paper is a brief review of point insertion techniques in Delaunay triangulations. Important works on the insertion of vertices in Delaunay triangulations and its dual graph, the Voronoi diagram, are described as a start point for one who needs to build a quality mesh using adaptive triangular-mesh refinement.