CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

First Page		Document Content
Date: 2008-10-28 21:30:44 Euclidean plane geometry Discrete geometry Computational geometry Shortest path problem Simple polygon Visibility Voronoi diagram Visibility graph Pseudotriangle Geometry Mathematics Polygons		CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 150,97 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