Discrete Comput Geom 19:373–Discrete - Convex set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2008-10-16 12:11:14 Discrete geometry Convex analysis Euclidean plane geometry K-set Crossing number Convex hull Convex function Arrangement of lines Pseudotriangle Mathematics Geometry Discrete mathematics		Discrete Comput Geom 19:373–Discrete & Computational Geometry Add to Reading List Source URL: www.cs.duke.edu Download Document from Source Website File Size: 111,63 KB Share Document on Facebook

	An Improved Bound for Joints in Arrangements of Lines in Spa e y z DocID: 1rkQA - View Document
	The Number of Edges of Many Faces in a Line Segment Arrangement1 B. Aronov2 , H. Edelsbrunner3 , L. J. Guibas4 , and M. Sharir5 Abstract We show that the maximum number of edges bounding m faces in an arrangement of DocID: 1r7Uq - View Document
	UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll DocID: 1qT0O - View Document