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

	TerraNNI: Natural Neighbor Interpolation on 2D and 3D Grids Using a GPU PANKAJ K. AGARWAL, Duke University ALEX BEUTEL, Carnegie Mellon University THOMAS MØLHAVE, SCALGO USA DocID: 1ru58 - View Document
	40 ALGORITHMIC MOTION PLANNING Mi ha Sharir INTRODUCTION DocID: 1rqDw - View Document
	PIECE BY PIECE: A METHOD OF CARTOGRAPHIC LINE GENERALIZATION USING REGULAR HEXAGONAL TESSELLATION P. Raposo Department of Geography, The Pennsylvania State University. University Park, Pennsylvania DocID: 1rnN0 - View Document
	Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th DocID: 1rmpv - View Document