Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§

First Page		Document Content
Date: 2010-04-22 09:35:25 Search 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 List Source URL: www.cs.ust.hk Download Document from Source Website File Size: 368,91 KB Share Document on Facebook

	PDF Document DocID: 1xSAp - View Document
	PDF Document DocID: 1xP7V - View Document
	PDF Document DocID: 1x8Vj - View Document
	PDF Document DocID: 1x2r1 - View Document
	PDF Document DocID: 1wHMX - View Document