First Page | Document Content | |
---|---|---|
Date: 2010-04-22 09:35:25Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory | Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§Add to Reading ListSource URL: www.cs.ust.hkDownload Document from Source WebsiteFile Size: 368,91 KBShare Document on Facebook |