Home  - Pure_And_Applied_Math - Convex Geometry

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

61-80 of 92    Back | 1  | 2  | 3  | 4  | 5  | Next 20

Convex Geometry:     more books (100)

Convexity and Related Combinatorial Geometry (Lecture Notes in Pure & Applied Mathematics) Integral Geometry And Convexity: Proceedings of the International Conference, Wuhan, China, 18 - 23 October 2004 Convex Bodies: The Brunn-Minkowski Theory (Encyclopedia of Mathematics and its Applications) by Rolf Schneider, 1993-02-26 Discrete Geometry and Convexity (Annals of the New York Academy of Sciences) Integer Points In Polyhedra: Geometry, Number Theory, Algebra, Optimization: Proceedings Of An Ams-ims-siam Joint Summer Research Conference On Integer ... Polyhedra, July 1 (Contemporary Mathematics) by Alexander Barvinok, AMS-IMS-SIAM JOINT SUMMER RESEARCH CONFE, 2005-06 The Principle of Least Action in Geometry and Dynamics (Lecture Notes in Mathematics) by Karl Friedrich Siburg, 2004-07-12 Computational Geometry and Graph Theory: International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers (Lecture Notes ... Vision, Pattern Recognition, and Graphics) Geometry and Convexity: A Study in Mathematical Methods by Paul J. Kelly, Max L. Weiss, 2009-06-22 Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry by Jürgen Richter-Gebert, 2011-03-01 Convex Bodies and Algebraic Geometry: An Introduction to the Theory of Toric Varieties (Ergebnisse Der Mathematik Und Ihrer Grenzgebiete 3 Folge) by Tadao Oda, 1988-02 Proceedings of the Seminar on Random Series, Convex Sets and Geometry of Banach Spaces, Aarhus, October 14 - October 20, 1974, Denmark Convex Functions and Optimization Methods on Riemannian Manifolds (Mathematics and Its Applications) by C. Udriste, 1994-07-31 The interface between convex geometry and harmonic analysis. (Regional conferenc by Alexander and Vladyslav Yaskin. Koldobsky, Convex geometry and group choice (Memorandum) by S. V Ovchinnikov, 1982

lists with details

61. Undercurrent Workshop Polyhedra, Convex Geometry And Optimization
    Undercurrent Workshop Polyhedra, convex geometry and Optimization, Bellairs Institute, Barbados March 714, 2004. Page 1 Page 2 Page 3  
    http://www.cs.mcgill.ca/~fukuda/download/source/Undercurrent2004_album/Undercurr

62. Angewandte Geometrie & Diskrete Mathematik - Forschungsschwerpunkt Computational
    Translate this page Mathematical programming and convex geometry. In PM Gruber and JM Wills, editors, Handbook of convex geometry, volume A, pages 627-674.  
    http://www-m9.ma.tum.de/dm/coco

63. Geometry And Topology
    Similarly, I am interested in the inverse spectral problem for the Laplacian. My second interest is in optimal problems of convex geometry.  
    http://www.math.gatech.edu/~harrell/GP/Rsrch/geotop.html
    
    Extractions: A significant development at Georgia Tech is the high number of recent hires in geometry and topology. This active research group runs three geometry/topology seminars, each of which has as a major component teaching graduate students. See Margaret Symington's home page for links to the seminar homepages. We are in the process of overhauling our graduate course offerings in geometry, topology and algebra. These now include one year of algebra, one year of differential geometry alternating with one year of algebraic geometry, and one year of algebraic topology alternating with one year of differential and geometric topology. Our course descriptions can be found at: http://www.math.gatech.edu/academic/courses/index.html?class=g Saugata Basu, Assistant Professor [Joint with CoC]

64. Faculty
    Apostolos Giannopoulos, Assistant Professor (DIVISION Analysis) convex geometry; Apostolos Hadjidimos, Professor (DIVISION Applied Math Statistics) Numerical  
    http://www.math.uoc.gr/~www-old/2001-02/people.html

65. Artem Zvavitch
    convex geometry; Geometric Functional Analysis; Probability; Harmonic Analysis. AMS Special Session on Analytic convex geometry, Lawrenceville, NJ, April 2004.  
    http://www.math.missouri.edu/~zvavitch/resume.html

66. Atlas: Convex Geometries: Recent Development By K. Adaricheva
    In particular, the lattice of closed sets of any finite convex geometry is joinsemidistributive, and every finite join-semidistributive lattice can be  
    http://atlas-conferences.com/cgi-bin/abstract/cake-48
    
    Extractions: Institute of Mathematics of SB RAS, Novosibirsk Convex Geometries: recent development Convex geometries are defined in combinatorics as the finite closure systems with the anti-exchange axiom . Via the lattices of closed sets they can be linked to the lattices with the unique irredundant decompositions that were studied in 40s by R.Dilworth. In recent paper by K.Adaricheva, V.Gorbunov and V.Tumanov "Join-semidistributive lattices and convex geometries'' (to appear in Adv.Math.) we discover a close connection of convex geometries with lattices satisfying the quasi-identity of join-semidistributivity: In particular, the lattice of closed sets of any finite convex geometry is join-semidistributive, and every finite join-semidistributive lattice can be embedded into the lattice of convex sets of some convex geometry. This also determines the place of the class of join-semidistributive lattices in the whole lattice hierarchy as a class that in some sense opposes to the class of modular lattices, the latter often being linked to the closure systems with the exchange-axiom The paper above introduces the general notion of a convex geometry as a (not necessarily finite) closure system with the anti-exchange axiom. This allows studying a wide class of closure systems that appear in different mathematical disciplines.

67. 52: Convex And Discrete Geometry
    Selected topics here 52 convex and discrete geometry. Introduction. 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.  
    http://www.math.niu.edu/~rusin/known-math/index/52-XX.html
    
    Extractions: POINTERS: Texts Software Web links Selected topics here 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). This classification also includes the study of polygons and polyhedra, and frequently overlaps discrete mathematics and group theory; through piece-wise linear manifolds, it intersects topology. This area also includes tilings and packings in Euclidean space. Browse all (old) classifications for this area at the AMS. Klee, Victor: "What is a convex set?", Amer. Math. Monthly 78 1971 616631. MR44#3202 LEDA can perform calculations with geometric and combinatorial objects.

68. Geometry In Action: Convex Hulls
    Ontario mentions an application of 3d convex hulls in mapping the surfaces of these machine, using the convex hulls of images of the pages. Part of geometry in Action, a  
    http://www.ics.uci.edu/~eppstein/gina/hull.html
    
    Extractions: Convex Hulls Castalia and Deimos . Philip Stook at U. Western Ontario mentions an application of 3d convex hulls in mapping the surfaces of these two asteroids. Convex hull, Voronoi diagram, and Delaunay triangulation software from Nina Amenta's CG software directory Convex hulls and interpolation . Ken Clarkson describes some implementation details of algorithms for convex hulls, alpha shapes, Voronoi diagrams, and natural neighbor interpolation. Image Processing and Pattern Recognition in Soil Structure . D. Luo of Glasgow uses convex hulls and other geometric techniques to analyze images of soil particles. Pneumonea and tuberculosis diagnosis . Jason Everhart of Los Alamos uses convex hulls as part of a heuristic for estimating the percentage of lung volume occupied by a pneumonea infection. This initial guess of the lung contour is then iteratively refined to a more accurate representation. US Patent 4704694 uses convex hulls to recognize objects from video images. US Patent 5086482 seems to cover gift-wrapping methods of computing convex hulls in bitmap images. US Patent 5159645 performs character recognition by using convex hulls to find the counters in each character. A similar idea also occurs in

69. Computational Geometry
    ICS 161 Design and Analysis of Algorithms. Lecture notes for March 7, 1996. Computational geometry. What is computational geometry? Many situations in which we need to write programs involve computations of a geometric nature. for finding convex hulls known as the Graham scan. The idea is a common one in computational geometry, known as  
    http://www.ics.uci.edu/~eppstein/161/960307.html
    
    Extractions: Lecture notes for March 7, 1996 Many situations in which we need to write programs involve computations of a geometric nature. For instance, in video games such as Doom, the computer must display scenes from a three-dimensional environment as the player moves around. This involves determining where the player is, what he or she would see in different directions, and how to translate this three-dimensional information to the two-dimensional computer screen. A data structure known as a binary space partition is commonly used for this purpose. In order to control robot motion , the computer must generate a model of the obstacles surrounding the robot, find a position for the robot that is suitable for whatever action the robot is asked to perform, construct a plan for moving the robot to that position, and translate that plan into controls of the robot's actuators. One example of this sort of problem is parallel parking a car how can you compute a plan for entering or leaving a parking spot, given a knowledge of nearby obstacles (other cars) and the turning radius of your own car? In scientific computation such as the simulation of the airflow around a wing, one typically partitions the space around the wing into simple regions such as triangles (as shown below), and uses some simple approximation (such as a linear function) for the flow in each region. The computation of this approximation involves the numerical solution of differential equations and is outside the scope of this class. But where do these triangles come from? Typically the actual input consists of a description of the wing's outline, and some algorithm must construct the triangles from that input this is another example of a geometric computation.

70. 3D Convex Hull Algorithm In Java
    3D convex Hull algorithm in Java. Joseph O'Rourke is Olin Professor of Computer Science at Smith College in Northampton, Massachusetts. His text Computational geometry in C has become one of the definitive computational geometry resources.  
    http://www.cs.sunysb.edu/~algorith/implement/orourke/implement.shtml
    
    Extractions: Joseph O'Rourke is Olin Professor of Computer Science at Smith College in Northampton, Massachusetts. His text Computational Geometry in C has become one of the definitive computational geometry resources. The programs coded in the text have been made freely available by anonymous ftp from Smith College and have been included at this site as well. In this distribution are standard C and Java language routines for simple computational geometric methods (determining whether a point lies inside a polygon, for instance) as well as robust implementations of complex computational geometry algorithms. Addressed are problems in motion planning, nearest neighbor determination (through the use of Delaunay triangulations and Voronoi diagrams), polygon intersection, convex hull computation, and polygon triangulation. Download Files (Smith College) Download Files (local site) Go to Joseph O'Rourke 's Home Page Robust Geometric Primitives (6)

71. Computational Geometry, Algorithms And Applications
    Recent book with a focus on applications, by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Includes chapters on linesegment intersection, polygon triangulation, linear programming, range searching, point location, Voronoi diagrams, arrangements and duality, Delaunay triangulations, geometric data structures, convex hulls, binary space partitions, robot motion planning, visibility graphs.  
    http://www.cs.ruu.nl/geobook/
    
    Extractions: ISBN: 3-540-65620-0 You can order the book here This textbook on computational geometry has 367 pages. The pages are almost square with a large margin containing over 370 figures. To get an idea about the style and format, take a look at the Introduction or chapter 7 on Voronoi diagrams Computational geometry emerged from the field of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains-computer graphics, geographic information systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self study.

72. Computational Geometry In C (Second Edition)
    A wellknown textbook by Joseph O'Rourke, including chapters on polygon triangulation, polygon partitioning, convex hulls in 2D and 3D, Voronoi diagrams, arrangements, search and intersection, and motion planning. Sample code in C and Java.  
    http://turing.csc.smith.edu/~orourke/books/compgeom.html
    
    Extractions: Second Edition: printed 28 September 1998. Purchasing information: Cambridge University Press servers: in Cambridge in New York ; Cambridge (NY) catalog entry (includes jacket text and chapter titles). Also amazon.com Contents: Some highlights: Basic statistics (in comparison to First Edition): approx. 50 pages longer 31 new figures. 49 new exercises.

73. Computational Geometry On The Web
    9. Complexity, convexity and Unimodality convex Set, convex function; Unimodal distance functions in geometry; Binary Search. 10. convex  
    http://cgm.cs.mcgill.ca/~godfried/teaching/cg-web.html

74. Springer-Verlag - Foundations Of Computing
    One of the wellknown early textbooks, by Herbert Edelsbrunner. Includes chapters on arrangements, convex hulls, linear programming, planar point location, Voronoi diagrams, and separation and intersection.  
    http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-13722-X

75. Springer Verlag - Your Publishers Of Books, Journals, And Electronic Media
    One of the wellknown early textbooks, by Franco P. Preparata and Michael Ian Shamos. Includes chapters on geometric searching, convex hulls, proximity, intersections, and rectangles.  
    http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-96131-3

76. Home Page For Qhull
    Past Software Projects of the geometry Center URL http//www.thesa.com/software/qhull/. The home page for Qhull has moved. Qhull computes convex hulls, Delaunay  
    http://www.geom.uiuc.edu/locate/qhull
    
    Extractions: URL: http://www.thesa.com/software/qhull/ Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. Please look for current software and current information on qhull at its new home: http://www.thesa.com/software/qhull/

77. Convex Hull -- From MathWorld
    Computing the convex hull is a problem in computational geometry. The indices of the points specifying the convex hull of a set  
    http://mathworld.wolfram.com/ConvexHull.html
    
    Extractions: Computing the convex hull is a problem in computational geometry . The indices of the points specifying the convex hull of a set of points in two dimensions is given by the command ConvexHull pts ] in the Mathematica add-on package DiscreteMath`ComputationalGeometry` (which can be loaded with the command ). Future versions of Mathematica will support n -dimensional convex hulls. In d dimensions, the "gift wrapping" algorithm, which has complexity where is the floor function , can be used (Skiena 1997, p. 352). In two and three dimensions, however, specialized algorithms exist with complexity

78. ThinkQuest : Library : Interactive Mathematics Online
    points in which not all segments connecting points of the set lie entirely in the set; synonym concave; see convex set. NonEuclidean geometry - solid geometry.  
    http://library.thinkquest.org/2647/geometry/glossary.htm
    
    Extractions: Index Math This mathematics site has tutorials in Algebra and Trigonometry and a very extensive section about Geometry. It also includes a lot of information about programming with Java, Chaos Theory, and fractal generation (Mandelbrot and Julia sets). There is even some software for creating stereograms, those three dimensional pictures that can only be seen inside your brain. Visit Site 1996 ThinkQuest Internet Challenge Awards GEM Languages English Students David Seaford High School, Seaford, DE, United States Amay Seaford High School, Seaford, DE, United States Jaime Seaford High School, Seaford, DE, United States Coaches Thomas Seaford High School, Salisbury, MD, United States Want to build a ThinkQuest site? The ThinkQuest site above is one of thousands of educational web sites built by students from around the world. Click here to learn how you can build a ThinkQuest site. Privacy Policy

79. Figures And Polygons
    convex. A figure is convex if every line segment drawn between any two points inside the figure lies entirely inside the figure.  
    http://www.mathleague.com/help/geometry/polygons.htm
    
    Extractions: Triangle ... Math Contests School League Competitions Contest Problem Books Challenging, fun math practice Educational Software Comprehensive Learning Tools Visit the Math League A polygon is a closed figure made by joining line segments, where each line segment intersects exactly two others. Examples: The following are examples of polygons: The figure below is not a polygon, since it is not a closed figure: The figure below is not a polygon, since it is not made of line segments: The figure below is not a polygon, since its sides do not intersect in exactly two places each: A regular polygon is a polygon whose sides are all the same length, and whose angles are all the same. The sum of the angles of a polygon with n sides, where n n - 2) degrees. Examples: The following are examples of regular polygons:

80. Convex And Computational Geometry Research Division
    Contact us. Links. convex and Computational geometry research division. Research staff Gábor Fejes Tóth, head of research division; Imre Bárány; András Bezdek;  
    http://www.renyi.hu/staff/geometry.html

61-80 of 92    Back | 1  | 2  | 3  | 4  | 5  | Next 20