Geometry.Net - Pure_And_Applied_Math: Convex Geometry


Home - Pure_And_Applied_Math - Convex Geometry

e99.com Bookstore

Images

Newsgroups

21-40 of 88 Back | 1 | 2 | 3 | 4 | 5 | Next 20

Convex Geometry: more books (100)

Strange Phenomena in Convex and Discrete Geometry (Universitext) by Chuanming Zong, 1996-06-25

The Cube-A Window to Convex and Discrete Geometry (Cambridge Tracts in Mathematics) by Chuanming Zong, 2006-02-20

Stochastic Geometry: Lectures given at the C.I.M.E. Summer School held in Martina Franca, Italy, September 13-18, 2004 (Lecture Notes in Mathematics / Fondazione C.I.M.E., Firenze) by A. Baddeley, I. Bárány, et all 2006-11-16

Excursions into Combinatorial Geometry (Universitext) by Vladimir Boltyanski, Horst Martini, et all 1996-12-05

Convex Analysis: Theory and Applications (Translations of Mathematical Monographs) by G. G. Magaril-Ilyaev, V. M. Tikhomirov, 2003-10

A.D. Alexandrov: Intrinsic Geometry of Convex Surfaces (Classics of Soviet Mathematics)

Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers ... Computer Science and General Issues)

Discrete Geometry, Combinatorics and Graph Theory: 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November ... Computer Science and General Issues)

Pairs of Compact Convex Sets: Fractional Arithmetic with Convex Sets (Mathematics and Its Applications) by Diethard Ernst Pallaschke, R. Urbanski, 2010-11-02

Discrete and Computational Geometry: Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers (Lecture Notes in Computer Science)

Geometry of Cuts and Metrics (Algorithms and Combinatorics) by Michel Marie Deza, Monique Laurent, 1997-06-27

Discrete and Computational Geometry: Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues)

Convex Integration Theory: Solutions to the h-principle in geometry and topology (Modern Birkhäuser Classics) by David Spring, 2010-12-29

Convex Polyhedra (Springer Monographs in Mathematics) by A.D. Alexandrov, 2010-11-30

lists with details

ACM Guide Subject Index
3, An APL package for convex geometry Richard A. Vitale , Alan J. Tarr Proceedingsof seventh international conference on APL June 1975 The package of APL
http://portal.acm.org/subjects.cfm?part=subject&row=H&idx=Hierarchy and geometri
[math/9211216] A Low-technology Estimate In Convex Geometry
From Greg Kuperberg greg@math.ucdavis.edu Date Sun, 1 Nov 1992000000 GMT (3kb) A lowtechnology estimate in convex geometry.
http://arxiv.org/abs/math.MG/9211216
Convexity.html
Jeffrey C. Lagarias convex geometry papers. Other papers related toconvexity can be found in the list of packing and tiling papers.
http://www.research.att.com/~jcl/convexity.html
Convex Geometry And Semiflows In P/T Nets. A Comparative Study Of Algorithms For
The Petri Nets Bibliography convex geometry and Semiflows in P/T Nets. AComparative convex geometry and Semiflows in P/T Nets. A Comparative
http://www.informatik.uni-hamburg.de/TGI/pnbib/c/colom_j_m3.html

Extractions: For the most recent entries see the Petri Nets Newsletter Colom, J.M. Silva, M. In: Proceedings of the 10th International Conference on Application and Theory of Petri Nets, 1989, Bonn, Germany , pages 74-95. 1989. Also: Universidad de Zaragoza, departamento de ingenieria electrica e informatica, Research Report 89-01, January 1989. Also in: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 483; Advances in Petri Nets 1990 , pages 79-112. Berlin, Germany: Springer-Verlag, 1991. Abstract: P-semiflows are nonnegative left annullers of a net's flow matrix. The concept of minimal p-semiflow is known in the context of mathematical programming under the name `extremal direction of a cone'. The algorithms known in the domain of P/T nets for computing elementary semi-flows are basically improvements of the basic Fourier-Motzkin method. One of the fundamental problems of these algorithms is their complexity. Various methods and rules for mitigating this problem are examined. As a result, the paper presents two improved algorithms which are more efficient and robust when handling `real-life' nets. Keywords: convex geometry (and) semiflows (in) place/transition net(s); minimal p-semiflows computation; Fourier-Motzkin method; complexity reduction.
Geometry
Algebraic topology Computational geometry convex geometry Differential geometryFractals General topology Knot theory Manifolds Polytopes convex geometry.
http://felix.unife.it/ /ma-ge
Felix.unife.it/Root/d-Mathematics/d-Geometry/b-Convex-geometry
W. Coppel Foundations of convex geometry. Cambridge UP 1998, 220p. 10279 PeterGruber/Joerg Wills (ed.) Handbook of convex geometry. 2 volumes.
http://felix.unife.it/Root/d-Mathematics/d-Geometry/b-Convex-geometry
Kutateladze's Curriculum Vitae
and explicit solution in Alexandrov surface area measures of isoperimetricalproblems with arbitrary constraints on mixed volumes in convex geometry.
http://www.math.nsc.ru/LBRT/g2/english/ssk/cv.html
Convex Geometry: Mixed Volumes And Related Concepts
Convex Dr. Markus Kiderlen, Universität Karlsruhe, Germany. convex geometryMixed volumes and related concepts. Abstract/
http://www.imf.au.dk/events/calendar/events/2173.html

Extractions: University of Aarhus STATISTICS SEMINAR Thursday, 22 March, 2001 at 14:15 in H2.28 Convex Geometry: Mixed volumes and related concepts Abstract/Description: The purpose of the talk is to give an accessible introduction to notions like 'Steiner formula', 'intrinsic volumes' and 'Minkowki's inequality'. All these concepts naturally arise if the volume of the vector-sum of two or more compact convex sets is considered. We will mainly restrict ourselves to the planar case ($d=2$) and only mention higher dimensional generalizations. We will also consider applications in Stochastic Geometry, such as randomly translated convex sets or contact distributions of germ-grain models. Contact person: Eva B. Vedel Jensen
Convex Geometry:
convex geometry Definitions convex polygon a polygon is convex ifyou can choose any two points from the interior of the polygon
http://www.stetson.edu/departments/mathcs/students/research/math/steph/tsld009.h
Convex Geometry:
First Previous Next Last Index Text. Slide 9 of 22.
http://www.stetson.edu/departments/mathcs/students/research/math/steph/sld009.ht
Description Of Courses
convex geometry and Optimization. Compare the schedule at the beginnof the term for hours and rooms. Responsible Instructor Bokowski.
http://www.mathematik.tu-darmstadt.de/Math-Net/Lehrveranstaltungen/SS1999/Haupts

Extractions: Go forward to History of mathematics: Analysis from Euler to Riemann Compare the schedule at the beginn of the term for hours and rooms Responsible Instructor: Bokowski Group Targeted: Students in mathematics Prerequisites: Basic knowledge of linear algebra Contents: The objective of the course is an introduction to the theory of convex bodies with special emphasis on linear optimization. When optimizing an objective funktion under linear constraints the admissable sets under consideration are convex cones or convex polytopes of in general high dimension. A deaper insight of algorithmical aspects in optimization requires first a study of convex polytopes and related concepts, like supporting hyperplane, facet, k-face, supporting function, distance function, face lattice, k-skeletons etc. During the lecture these concepts will be developped along a Graduate Text in Mathematics, Arne Broendsted, An Introduction to Convex Polytopes. Also nonpolytopal convex sets play a role.
Veranstaltungen - Arbeitsgruppe 7
Programme. Workshop Discrete convex geometry . 2. 4. February 2003 in honourof Jürgen Bokowski's 60th birthday. convex geometry and Knots . 4.45 - 5.15 pm.
http://www.mathematik.tu-darmstadt.de/ags/ag7/Workshops/Programm2_en.html

Extractions: About us Secretary's Office Members Research ... How to find us Programme Workshop "Discrete Convex Geometry" Conference office open 12.00 - 5.30 p.m. 3 rd floor, room 310 , Secretary Ursula Roeder Sunday, February Venue: Department of Mathematics, Schlossgartenstr. 7, 1 st floor, room 134 12.00 - 2.00 p.m. arrival Office room, Ursula Roeder: 310 Bernd Sturmfels, Berkeley, USA "The Geometry of Nash Equilibria" 3.00 - 3.30 p.m. B r e a k st floor 3.30 - 4.00 p.m. Horst Martini, Chemnitz "Location Problems in Minkowski Spaces" 4.00 - 4.30 p.m. Tudor Zamfirescu, Dortmund "Acute Triangulations" 4.30 - 5.00 p.m. B r e a k st floor 5.00 - 5.30 p.m. Simon King, Darmstadt "On a Topological Representation Theorem for Oriented Matroids" Phillippe Cara, Brussels, Belgium, (at present: USA) "Spherical Designs in 4 Dimensions" 6.00 - 6.30 p.m. Michel Las Vergnas, Paris, France "Linear Programming in Oriented Matroids and the Tutte Polynomial" Monday, February, 3 : 9.00 - 10.00 a.m. "Some New Construction Techniques For 4-Dimensional Polytopes" 10.00 - 10.30 a.m. B r e a k 10.30 - 11.00 a.m.
Abteilung Für Analysis - Research
Main research. convex geometry, In convex geometry, geometric and analyticmethods are used to study convex sets and convex functions.
http://osiris.tuwien.ac.at/~analysis/research.html

Extractions: Geometry of Numbers Geometry of Numbers forms a bridge between convexity, Diophantine approximation and the theory of quadratic forms. Today it is an independent problem-oriented field of mathematics having relations with coding theory, numerical integration, computational geometry and optimization. Geometry of Numbers has a long tradition in Vienna and at the Department of Analysis the following problems are studied: TU Wien Homepage
68U: Computer Graphics And Computational Geometry
Subject Classifications, computational topics primarily focused on geometry are classifiedin sections 51 Geometry and 52 convex geometry and their subareas
http://www.math.niu.edu/~rusin/known-math/index/68U05.html

Extractions: POINTERS: Texts Software Web links Selected topics here At present there is really nothing here regarding computer graphics per se; this is primarily focused on computational geometry. In keeping with the general pattern of use of the Mathematics Subject Classifications, computational topics primarily focused on geometry are classified in sections 51: Geometry and 52: Convex Geometry and their subareas such as 52B: Polygons and polyhedra . This classification is intended for topics whose geometric aspects are fairly straightforward, but for which the main questions involve efficient, accurate computation. Many geometric questions arise involving large sets of points (e.g. which of these points are closest together?) which are arguably combinatorics or statistics , but we have included them here. Some problems (e.g. finding the best circle passing through some points) are considered Statistics.
CMIS Research - Image Analysis - Applications/Work Overview - Hyperspectral Imag
scene). Fig. 2 Toy example of convex geometry model (M = 3) with noiseendmembers lie at the vertices of the triangle. The leading
http://www.cmis.csiro.au/iap/RecentProjects/hyspec_eg.htm

Extractions: Fig. 1: (a) 54 AVIRIS shortwave infrared images of Oatman, Arizona (courtesy of NASA JPL). (b) "Stackplot" of spectra at 6 pixels in the Oatman Image. Please click on the images for an enlarged view. Fig. 2: Toy example of convex geometry model (M = 3) with noise: endmembers lie at the vertices of the triangle The leading hyperspectral image analysis package, ENVI , has a method which finds the "pointiest" pixels (i.e. near vertices) using the "Pixel Purity Index". Clusters of such points are identified interactively as likely endmember clusters. More sophisticated methods include those of Craig (1994) which finds the simplex of minimum volume with a given number of vertices and completely enclosing the data "cloud"; and the N-FINDR algorithm of Winter (1999), which finds the simplex of maximum volume whose vertices are constrained to be a subset of the data points. N-FINDR is in commercial use. The Craig and Winter solutions for the toy example are shown in Fig. 3 (in pink and blue respectively). Note that Craig's solution is too large in the presence of noise, while Winter's will be too small if some materials in the scene are not represented by whole pixels.
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CRETE Knossos Ave, GR-
Apostolos Giannopoulos, Associate Professor (DIVISION Analysis) convex geometry;Emmanuil Katsoprinakis, Associate Professor and Chair (DIVISION Analysis
http://www.math.uoc.gr/dept/people.html
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CRETE
Apostolos Giannopoulos, Assistant Professor (DIVISION Analysis) convex geometry. NikosDafnis. Marianna Hartzoulaki, PhD Candidate convex geometry.
http://www.math.uoc.gr/~www-old/2000-01/people.html
HallMathematics.com :: Handbook Of Convex Geometry : Volume A
You are here Mathematics Geometry Topology Handbook of convex geometry Volume A. Search (books). Handbook of convex geometry Volume A.
http://hallmathematics.com/index.php/Mode/product/AsinSearch/0444895965/name/Han
Glossary
A convex body is, technically, a closed and bounded convex set with nonzero volume.convex geometry The study of convex shapes, usually in Euclidean space.
http://www.math.ucdavis.edu/profiles/glossary.html

Extractions: Index: A B C D ... Z A algebraic geometry Traditionally, the geometry of solutions in the complex numbers to polynomial equations. Modern algebraic geometry is also concerned with algebraic varieties, which are a generalization of such solution sets, as well as solutions in fields other than complex numbers, for example finite fields. algebraic topology The branch of topology concerned with homology and other algebraic models of topological spaces algebraic variety A space which is locally the solution locus to a set of polynomial equations. Algebraic varieties are for algebraic geometry topological spaces are for topology manifolds . However, algebraic varieties may also have complicated singular sets and may be parametrized with rings other than the complex numbers. (For the technical reason that the real numbers are not algebraically closed, one does not consider algebraic varieties over the real numbers in the straightforward sense.) alternating-sign matrix A matrix of 0's, 1's, and -1's such that, if the zeroes are deleted from any row or column, the remaining entries alternate in sign and begin and end with 1. almost complex manifold A manifold with the property that each tangent space has the structure of a complex vector space, but the complex structures are not necessarily compatible with true complex coordinates as they are for a complex manifold.
Spring School 2001 - List Of The Talks
2). April 18, Wednesday, Petra Smolikova HighDimensional ConvexGeometry (1), Karl Koehler High-Dimensional convex geometry (3).
http://kam.mff.cuni.cz/~spring/2001/talks.html

Extractions: Day Morning session Evening session April 17, Tuesday Daniel Kral : Tree Decomposition Algorithms (1) Zdenek Dvorak : Tree Decomposition Algorithms (2) April 18, Wednesday Petra Smolikova : High-Dimensional Convex Geometry (1) Karl Koehler : High-Dimensional Convex Geometry (3) Dirk Mueller : High-Dimensional Convex Geometry (2) Jochen Alber : Parametrized Algorithms April 19, Thursday Tomas Chudlarsky : Set-pair method (1) Ondrej Pangrac : Small Worlds Robert Samal : Set-pair method (2) Jan Foniok : Distance in Small Worlds April 20, Friday Stephan Held : Small Worlds and the Web Ulrich Brenner : Approximations of Steiner tree problem (2) Martin Mares : Approximations of Steiner tree problem (1) April 21, Saturday Diana Piguetova : Set-pair method (3) Martin Pergel : Convex holes Jan Kara : Erdos-Szekeres Theorem April 22, Sunday Jana Maxova : High-Dimensional Spheres April 23, Monday Jakub Cerny : High-Dimensional Convex Geometry (4) Omer Gimenez : Probablity and Computation (1) Robert Babilon : High-Dimensional Convex Geometry (5) April 24, Tuesday

21-40 of 88 Back | 1 | 2 | 3 | 4 | 5 | Next 20