|
Convex geometry - Wikipedia, the free encyclopedia
Convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas of mathematics: computational geometry, convex analysis, discrete ...
en.wikipedia.org/wiki/Convex_geometry |
|
|||
|
|||
|
Convex and discrete geometry includes the study of convex subsets of Euclidean space. A wealth of famous results distinguishes this family of sets (e.g. Brouwer's fixed-point theorem, the isoperimetric problems).
|
|||
|
18.409: Convex Geometry and Random Walks; ... Algorithmic problems in geometry often become tractable with the assumption of convexity (e.g. optimization, volume computation, learning, finding the average etc.). We will study this phenomenon in depth, beginning with classical topics such as the Brunn-Minkowski inequality...
|
|||
|
On the volume of the intersection of two Lpn balls, Proceedings of the AMS 110 (1990) 217-224 (with G. Schechtman). ... On the Gaussian measure of the intersection of symmetric, convex sets, Ann. of Probab. 26 (1998) 346-357, (with G. Schechtman and Th. Schlumprecht).
|
|||
|
and Khande lwal, G. S.: Proton Dose Approx imation in Arbitrary Convex Geometry. Nucl. Technol., vol . 23, no. 3, Sept. 1974, pp. 298--305.; Home/Search Document Not in Database Summary Related Articles Check...
|
|||
|
The Petri Nets Bibliography: Convex Geometry and Semiflows in P/T Nets. A Comparative Study of Algorithms for Computation of Minimal P-Semiflows. ... Keywords: convex geometry (and) semiflows (in) place/transition net(s); minimal p-semiflows computation; Fourier-Motzkin method; complexity reduction.
|
|||
|
Document Imaging - OCR Toolkit, Barcode Toolkit, convex (geometry) ... In simpler words, if a rubber band could be snugly wrapped around a convex blob there would be no places where the rubber band lifts off and is not touching the blob.
|
Copyright © 2009, Dictionary.com, LLC. All rights reserved.