Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2) > Geometrical Problems And Computations (F.2.2...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 335 Reviews about "Geometrical Problems And Computations (F.2.2...)": Date Reviewed   Linear-time approximation schemes for clustering problems in any dimensions Kumar A., Sabharwal Y., Sen S.  Journal of the ACM 57(2): 1-32, 2010. Type: Article Clustering is a fundamental problem of study that has an increasing number of applications in machine learning, data analysis, and other related areas. All of these areas frequently witness an excessively large volume of data, spread in a complex ... May 14 2010   Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings Miller E., Pak I.  Discrete & Computational Geometry 39(1): 339-388, 2008. Type: Article This is a long, complex, and incredibly rich paper. It contains, in some sense, one main result: the source unfolding that unfolds the surface of a convex polyhedron P to a planar, nonoverlapping polygon Apr 8 2010   Least square projection: a fast high-precision multidimensional projection technique and its application to document mapping Paulovich F., Nonato L., Minghim R., Levkowitz H.  IEEE Transactions on Visualization and Computer Graphics 14(3): 564-575, 2008. Type: Article A new technique, least square projection (LSP), is proposed for projecting a set of points in a high-dimensional space to a low-dimensional one. The authors claim that it encompasses good features of both linear and nonlinear projection methods.... Sep 15 2009   Randomized self-assembly for approximate shapes Kao M., Schweller R.  ICALP 2008 (Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part I, Reykjavik, Iceland,  Jul 7-11, 2008) 370-384, 2008. Type: Proceedings Most theoretical investigations of self-assembly are based on Winfree’s tile assembly model, in which unit squares with specific glues on each side bind in a mixture to spontaneously form a desired shape. Ultimately, that shape may be a... Aug 18 2009   On the number of facets of three-dimensional Dirichlet Stereohedra III: full cubic groups Sabariego P., Santos F.  Discrete & Computational Geometry 40(2): 159-189, 2008. Type: Article Suppose that S is a discrete point set in Rn. For any point p ∈ S, the Voronoi o region is the set of points in... Apr 16 2009   A fast direct solver for the biharmonic problem in a rectangular grid Ben-Artzi M., Croisille J., Fishelov D.  SIAM Journal on Scientific Computing 31(1): 303-333, 2008. Type: Article The biharmonic problem comes up in important application areas such as fluid dynamics. Methods to solve it have become more complex as computers have improved in speed and storage capacity. The methods are based on a finite-difference... Mar 26 2009   A generic grid interface for parallel and adaptive scientific computing: Part I: abstract framework Bastian P., Blatt M., Dedner A., Engwer C., Klöfkorn R., Ohlberger M., Sander O.  Computing 82(2): 103-119, 2008. Type: Article Typical algorithms in scientific computing, such as finite element methods for the numerical solution of partial differential equations, require a grid to discretize the domain where the solution of the equation is sought. Modern methods... Mar 17 2009    Computing visibility on terrains in external memory Haverkort H., Toma L., Zhuang Y.  Journal of Experimental Algorithmics 13: 1.5-1.23, 2008. Type: Article This paper represents a fusion of algorithmic concepts pulled from the work of several prominent researchers in the field of geographic information systems (GIS): P.K. Agarwal, J.S. Vitter, G.S. Brodal, L. Toma, and V. Kreveld, to mention just a... Feb 19 2009   Geometric observers for dynamically evolving curves Niethammer M., Vela P., Tannenbaum A.  IEEE Transactions on Pattern Analysis and Machine Intelligence 30(6): 1093-1108, 2008. Type: Article Imagine tracking the image of a fish in murky waters. Not only is the image difficult to discern, but also the outline of the fish changes with the dynamics of the fish’s swimming. This paper seeks to address problems of this nature. In... Dec 30 2008   Digitally archiving cultural objects Ikeuchi K., Miyazaki D.,  Springer, 2007.Type: Book Until fairly recently, digitization and digital archival work have focused on physically smaller works such as visual arts, textual works, and other two-dimensional (2D) representational genres. The state of the art in digitization has been... Sep 17 2008       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2010 Reviews.com Terms of Use | Privacy Policy