A near-optimal heuristic for minimum weight triangulation of convex polygons
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computing a threaded quadtree from the Delaunay triangulation in linear time
Nordic Journal of Computing
Approximating a minimum Manhattan network
Nordic Journal of Computing
Hi-index | 0.00 |