A heuristic triangulation algorithm
Journal of Algorithms
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Heuristics for optimum binary search trees and minimum weight triangulation problems
Theoretical Computer Science
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
A (usually?) connected subgraph of the minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
On computing edges that are in all minimum-weight triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Studies in computational geometry motivated by mesh generation
Studies in computational geometry motivated by mesh generation
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |