Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing a threaded quadtree from the Delaunay triangulation in linear time
Nordic Journal of Computing
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 0.00 |