An ω(√n) lower bound for the nonoptimality of the greedy triangulation
Information Processing Letters
A heuristic triangulation algorithm
Journal of Algorithms
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 sums of radicals in polynomial time
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Polynomial-time instances of the minimum weight triangulation problem
Computational Geometry: Theory and Applications
Fast greedy triangulation algorithms
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
The extensible drawing editor Ipe
Proceedings of the eleventh annual symposium on Computational geometry
Approaching the largest &bgr;-skeleton within a minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
A New Subgraph of Minimum Weight Triangulations
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Diamonds Are Not a Minimum Weight Triangulation's Best Friend
Proceedings of the 8th Canadian Conference on Computational Geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Optimal and suboptimal robust algorithms for proximity graphs
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
Eliminating contour line artefacts by using constrained edges
Computers & Geosciences
An incremental algorithm for distributed minimum weight triangulation
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
The minimum stabbing triangulation problem: IP models and computational evaluation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Fundamenta Informaticae - Emergent Computing
Approximated algorithms for the minimum dilation triangulation problem
Journal of Heuristics
| Hi-index | 0.00 |