id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
7m01bk14753	Ewa Misiolek	Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing	2011		.txt	text/plain	357	14	45	For example, we reduce the space requirement for a class of problems that seek a path from among many shortest paths in certain weighted grid graphs, we develop new algorithms for processing an off-line sequence of insertions and deletions of convex polygons interspersed with certain point queries on the common intersection of the polygons, and for finding a line segment of a fixed-length that intersects the maximum number of given polygons. Our methods combine geometric modeling, new algorithmic techniques, and new data structures.	cache/7m01bk14753.txt	txt/7m01bk14753.txt