Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
A new and simple algorithm for quality 2-dimensional mesh generation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Quality Mesh Generation in Higher Dimensions
SIAM Journal on Computing
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
Delaunay refinement mesh generation
Delaunay refinement mesh generation
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Time complexity of practical parallel steiner point insertion algorithms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Sparse parallel Delaunay mesh refinement
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Triangulations with locally optimal Steiner points
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Computational Geometry: Theory and Applications
Size complexity of volume meshes vs. surface meshes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A template for developing next generation parallel Delaunay refinement methods
Finite Elements in Analysis and Design
Dynamic well-spaced point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Efficient and good Delaunay meshes from random points
Computer-Aided Design
A review on delaunay refinement techniques
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Dynamic well-spaced point sets
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes O(n log n + m) time, where n is the input size and m is the output size. This is the first time-optimal Delaunay refinement algorithm.