An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximation algorithms for planar traveling salesman tours and minimum-length triangulations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Near-optimal triangulation of a point set by simulated annealing
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Approximating the minimum weight triangulation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast greedy triangulation algorithms
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Approaching the largest &bgr;-skeleton within a minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth 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 near-optimal heuristic for minimum weight triangulation of convex polygons
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient implementation of a planar point location method
Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
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
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
Minimum weight convex Steiner partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A fixed parameter algorithm for optimal convex partitions
Journal of Discrete Algorithms
A quasi-polynomial time approximation scheme for minimum weight triangulation
Journal of the ACM (JACM)
An incremental algorithm for distributed minimum weight triangulation
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight time bounds for the minimum local convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Minimum weight triangulation by cutting out triangles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Minimum weight pseudo-triangulations
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fundamenta Informaticae - Emergent Computing
| Hi-index | 0.00 |