An O(log n) time parallel algorithm for triangulating a set of points in the plane
Information Processing Letters
An optimal parallel algorithm for triangulating a set of points in the plane
International Journal of Parallel Programming
A heuristic triangulation algorithm
Journal of Algorithms
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
ACM SIGACT News
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A parallel approximation algorithm for minimum weight triangulation
Nordic Journal of Computing
On Parallel Complexity of Planar Triangulations
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
| Hi-index | 0.00 |
A distributed heuristic algorithm for computing approximations of the minimum weight triangulation of a set of points in Euclidean plane, is described. The new algorithm, named DWT, is incremental and can add multiple points to the existing triangulation simultaneously. The algorithm needs less information about the neighbourhood of the point being added than, for instance, LMT heuristic algorithm. The quality of the produced approximations is measured experimentally and compared against the LMT heuristics. As the algorithm is designed so that every point is placed on its own node in a distributed system, the algorithm is perfectly suited for constructing triangulated overlay networks on the fly.