Search for Author All Reviews
	Sharir, Micha     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 15 reviews       Hausdorff distance under translation for points and balls Agarwal P., Har-Peled S., Sharir M., Wang Y. ACM Transactions on Algorithms 6(4): 1-26, 2010.  Type: Article In the protein docking problem, pairs of molecules modeled as unions of balls are shape-matched by finding close but noncolliding positionings of the molecules. This provides one motivation for this work, which develops algorithms for ...... Nov 18 2010     Partial surface and volume matching in three dimensions Barequet G., Sharir M. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(9): 929-948, 1997.  Type: Article For the analysis or generation of three-dimensional models, there is a need to match these models of the surface or the volume enclosed by the surface. This paper describes a system that uses the geometric hashing technique and works o...... Jul 1 1998     Ray shooting amidst spheres in three dimensions and related problems Mohaban S., Sharir M. SIAM Journal on Computing 26(3): 654-674, 1997.  Type: Article The authors address ray-shooting amid n spheres in three-dimensional space and, in particular, the problem of quickly identifying the first sphere hit by a query ray. They show that, for any &egr; &g...... Mar 1 1998     Davenport-Schinzel sequences and their geometric applications Sharir M., Agarwal P., Cambridge University Press, New York, NY, 1996.  Type: Book (9780521470254) Davenport-Schinzel sequences are deep and beautiful, simple but subtle combinatorial structures arising in a wide variety of geometric constructions. The remarkable story of their analysis is told in this book by two of the primary dev...... Jun 1 1997     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     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy