Search for Author All Reviews
	Seidel, Raimund     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       Selecting heavily covered points Chazelle B. (ed), Edelsbrunner H. (ed), Guibas L. (ed), Hershberger J., Seidel R., Sharir M. SIAM Journal on Computing 23(6): 1138-1151, 1994.  Type: Article Let P = { p1 , p2 ,..., pn } be a finite-point set in three-dimensional space and consider the so-called Delaunay triangulation D ( P ) consisting...... Nov 1 1995     On the all-pairs-shortest-path problem Seidel R.  Theory of computing (, Victoria, British Columbia, Canada, May 4-6, 1992) 7491992.  Type: Proceedings An ingenious simple trick enables the author to improve a previous result of myself, Z. Galil, and O. Margalit [1] for an interesting special case. He obtains an algorithm that finds the distances between all pairs of vertices of an ... Mar 1 1993
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy