Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Convex Geometry Bookstore
Page 4     61-80 of 92    Back | 1  | 2  | 3  | 4  | 5  | Next 20

         Convex Geometry:     more books (100)
  1. Technical report by Andrew Klapper, 1987
  2. Lie Groups, Convex Cones, and Semigroups (Oxford Mathematical Monographs) by Joachim Hilgert, Karl Heinrich Hofmann, et all 1989-11-16
  3. The maximum number of ways to stab n convex non-intersecting objects in the plane is 2n-2 (Report / UIUCDCS-R-87) by Herbert Edelsbrunner, 1987
  4. A lower bound on the number of unit distances between the vertices of a convex polygon (Report / UIUCDCS-R-88-) by Herbert Edelsbrunner, 1988
  5. Join Geometrics: A Theory of Convex Sets and Linear Geometry.
  6. Join Geometrics: A Theory of Convex Sets and Linear Geometry. by Walter Prenowitz, 1979
  7. Probing convex polygons with half-p]anes (Report) by Steven A Skiena, 1987
  8. Ordered incidence geometry and the geometric foundations of convexity theory (Research report) by A Ben-Tal, 1984
  9. Some random secants through a convex body (Impresiones previas) by Fernando Affentranger, 1986
  10. Digital topology of sets of convex voxels (CS-TR) by Punam K Saha, 1998
  11. The convex hull of random circles (Computer science technical report) by Fernando Affentranger, 1991
  12. Convex Optimization & Euclidean Distance Geometry by Jon Dattorro, 2006-07-07
  13. Convex Integration Theory: Solutions to the h-principle in geometry and topology (Monographs in Mathematics)
  14. Pairs of Compact Convex Sets - Fractional Arithmetic with Convex Sets (MATHEMATICS AND ITS APPLICATIONS Volume 548) by D. Pallaschke, R. Urbanski, et all 2002-10-01

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

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.
var HrefTUdVersion = ""; var HrefZentrumMathdVersion = ""; var HrefInstitutdVersion = "/"; var HrefHarvestsdVersion = ""; var HrefEnglishVersion = ""; Hauptseite des Lehrstuhls Forschungsschwerpunkte Computational Convexity
Diskrete Mathematik Computational Convexity
] und [
Radien, Konditionszahlen und Norm-Maximierung Ein dem Durchmesserproblem sehr verwandtes Problem ist die Berechnung von Die Berechnung obiger Funktionale in beliebigen l p ]. Speziell treten Dickeberechnungen bei Verfahren zur Krebsdiagnose auf (siehe [
K.S. Banerjee.
Weighing Designs for Chemistry, Medicine, Economics, Operations Research, Statistics.
Marcel Dekker, New York, 1975.
P. Gritzmann and V. Klee.
On the 0-1-maximization of positive definite quadratic forms.
In D. Pressmar et al., editors

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.
Geometry and Topology at Georgia Tech
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:
Faculty in Geometry and Topology
Saugata Basu, Assistant Professor [Joint with CoC]
(404)-894-2416, Skiles 116
    My research interests are in computational algebra and geometry, with special focus on algorithmic real algebraic geometry and topology. I am also interested in the applications of techniques from computational algebraic geometry to problems in discrete geometry and theoretical computer science.
Igor Belegradek
    I work in Riemannian geometry, studying the interplay between curvature and topology. My other interests include rigidity and flexibility of geometric structures, geometric analysis, and asymptotic geometry of groups and spaces.

64. Faculty
Apostolos Giannopoulos, Assistant Professor (DIVISION Analysis) convex geometry; Apostolos Hadjidimos, Professor (DIVISION Applied Math Statistics) Numerical
D EPARTMENT OF M ATHEMATICS ... RETE Knossos Ave, GR-714 09 Iraklio, Greece. Tel: +30 (0)810393801 Fax +30 (0)810393881 Faculty Emeriti Fellows Visiting Faculty ... Everybody's Picture
  • Jannis Antoniadis Professor DIVISION Algebra - Geometry)
    Number Theory
  • Christos Athanasiadis Assistant Professor DIVISION Algebra - Geometry)
    Combinatorics, Discrete Geometry
  • Ioannis Athanasopoulos Professor DIVISION Applied Math - Statistics)
    Partial Differential Equation, Free Boundary Problems
  • Konstantin Athanasopoulos Assistant Professor DIVISION Algebra - Geometry)
    Dynamical Systems
  • Apostolos Giannopoulos Assistant Professor DIVISION Analysis)
    Convex Geometry
  • Apostolos Hadjidimos Professor DIVISION Applied Math - Statistics)
    Numerical Analysis
  • Emmanuil Katsoprinakis Associate Professor and Chair DIVISION Analysis)
    Harmonic Analysis, Complex Variables
  • Vassilis Klonias Associate Professor DIVISION Applied Math - Statistics)
  • Mihalis Kolountzakis Associate Professor DIVISION Analysis)
    Harmonic Analysis, Combinatorial Problems, Computation
  • Georgios Kossioris Associate Professor DIVISION Applied Math - Statistics)
    Nonlinear PDE and applications
  • Christos Kourouniotis Assistant Professor DIVISION Algebra - Geometry) Geometry
  • Alexandros Kouvidakis Associate Professor DIVISION Algebra - Geometry) Algebraic Geometry
  • Doukissa Kritikou Lecturer DIVISION Applied Math - Statistics) Statistics
  • Michael Lambrou Associate Professor and Division Director DIVISION Analysis) Functional Analysis
  • Paris Pamfilos Associate Professor and Division Director DIVISION Algebra - Geometry) Geometry
  • 65. Artem Zvavitch
    convex geometry; Geometric Functional Analysis; Probability; Harmonic Analysis. AMS Special Session on Analytic convex geometry, Lawrenceville, NJ, April 2004.
    Personal resume
    Artem Zvavitch
    Mathematics Department
    202 Mathematical Sciences Bldg
    University of Missouri Columbia, MO 65211 USA
    Phone: (573)-882-4884 (office) (573)-445-73-83(home)
    06.09.1974, Moscow, Russia
    Marital Status
    married + 2.
    Wife: Tatiana Zvavitch
    Children: daughters Polina (born 22.06.1994) and Maya (born 05.08.1999).
    Fields of interest:
    • Convex Geometry
    • Geometric Functional Analysis
    • Probability
    • Harmonic Analysis
    • Ph.D. student of Gideon Schechtman , Weizmann Institute of Science, Department of Mathematics,(Rehovot, Israel).
    • M.Sc. student of Oded Schramm , Weizmann Institute of Science, Department of Mathematics,(Rehovot, Israel).
    • B.Sc. student, Moscow State University, Mechanics and Mathematics Department.
    • Graduated Moscow School # 67 (Moscow, USSR).
    • 2001-present: Post Doctoral Fellow, Mathematics Department, University of Missouri-Columbia.

    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
    Atlas home Conferences Abstracts about Atlas 65th Workshop on General Algebra, 18th Conference for Young Algebraists
    March 2123, 2003
    University of Potsdam
    Potsdam, Germany Organizers
    Klaus Denecke, Jörg Koppitz View Abstracts
    Conference Homepage
    Convex Geometries: recent development
    K. Adaricheva
    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.
    Search Subject Index MathMap Tour ... Help! ABOUT: Introduction History Related areas Subfields
    POINTERS: Texts Software Web links Selected topics here
    52: Convex and discrete 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). 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.
    Applications and related fields
    Browse all (old) classifications for this area at the AMS.
    Textbooks, reference works, and tutorials
    Klee, Victor: "What is a convex set?", Amer. Math. Monthly 78 1971 616631. MR44#3202
    Software and tables
    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
    Convex Hulls

    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
    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 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.
    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. 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
    Problem Links
  • Robust Geometric Primitives (6)
  • Convex Hull (6)
  • Nearest Neighbor Search (5)
  • Intersection Detection (5) ...
    The Stony Brook Algorithm Repository go to front page
    This page last modified on Sep 1, 1999.
  • 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.
    About the book
  • Cover
  • Table of contents
  • Errata (1st edition)
  • Errata (2nd edition) ...
  • Order Implementation
  • CGAL
  • LEDA
  • More software Further reading
  • Books
  • Bibliography
  • Web sites Comments to
    Last modified
    Oct 9, 2000
    Computational Geometry: Algorithms and Applications
    Second Edition
    Mark de Berg Otfried Schwarzkopf TU Eindhoven (the Netherlands)
    Marc van Kreveld
    Mark Overmars Utrecht University (the Netherlands) published by Springer-Verlag 2nd rev. ed. 2000. 367 pages, 370 fig.
    Hardcover DM 59
    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
    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.
    Computational Geometry in C (Second Edition)
    by Joseph O'Rourke
    Second Edition: printed 28 September 1998. Purchasing information:
    • Hardback: ISBN 0521640105, $69.95 (55.00 PST)
    • Paperback: ISBN 0521649765, $29.95 (19.95 PST)
    Cambridge University Press servers: in Cambridge in New York ; Cambridge (NY) catalog entry (includes jacket text and chapter titles). Also Contents: Some highlights:
    • 376+xiii pages, 270 exercises, 210 figures, 259 references.
    • Although I've retained the title C , all code has been translated to Java, and both C and Java code is available free.
    • Java Applet to permit interactive use of the code: CompGeom Java Applet
    • First Edition code improved: Postscript output, more efficient, more robust.
    • New code (see below).
    • Expanded coverage of randomized algorithms, ray-triangle intersection, and other topics (see below).
    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
    "The book of nature is written in the characters of geometry." - Galileo Go to Specific Links Related to 308-507 (Computational Geometry course).
    General Links - Computational Geometry:

    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.

    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.

    76. Home Page For Qhull
    Past Software Projects of the geometry Center URL http// The home page for Qhull has moved. Qhull computes convex hulls, Delaunay
    Up: Past Software Projects of the Geometry Center
    The home page for Qhull has moved
    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:

    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
    INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index
    ABOUT THIS SITE About MathWorld About the Author
    DESTINATIONS What's New MathWorld Headline News Random Entry ... Live 3D Graphics
    CONTACT Email Comments Contribute! Sign the Guestbook
    MATHWORLD - IN PRINT Order book from Amazon Geometry Computational Geometry Convex Hulls ... LiveGraphics3D Applets
    Convex Hull
    The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S . For N points the convex hull C is then given by the expression
    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.
    Index Math
    Interactive Mathematics Online
    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.
    Figures and polygons
    Regular polygon


    ... 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:
    Regular Polygon
    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:
    Examples: The following are not examples of regular polygons:
    1) The vertex of an angle is the point where the two rays that form the angle intersect.
    2) The vertices of a polygon are the points where its sides intersect.

    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;
    * Text version *


    The Institute

    - General

    Convex and Computational Geometry research division
    Research staff
    Associated members
    • Vera Rosta
    Contact the webmaster

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

    free hit counter