1. Basic convexity 2. Boundary structure 3. Minkowski addition 4. Curvature measure and quermass integrals 5. Mixed volumes 6. Inequalities for mixed volumes 7. Selected applications Appendix.

/pdf/convex-bodies-the-brunn-minkowski-theory-3raynvod45.pdf

Convex bodies : the Brunn-Minkowski theory

This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.

Algorithms in Combinatorial Geometry

A text that makes the mathematical underpinnings of robot motion accessible and relates low-level details of implementation to high-level algorithmic concepts. Robot motion planning has become a major focus of robotics. Research findings can be applied not only to robotics but to planning routes on circuit boards, directing digital actors in computer graphics, robot-assisted surgery and medicine, and in novel areas such as drug design and protein folding. This text reflects the great advances that have taken place in the last ten years, including sensor-based planning, probabalistic planning, localization and mapping, and motion planning for dynamic and nonholonomic systems. Its presentation makes the mathematical underpinnings of robot motion accessible to students of computer science and engineering, rleating low-level implementation details to high-level algorithmic concepts.

Principles of Robot Motion: Theory, Algorithms, and Implementations

A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible to a finite number of polynomial equalities and inequalities, it is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility. The main tools employed are a semidefinite programming formulation of the sum of squares decomposition for multivariate polynomials, and some results from real algebraic geometry. The techniques provide a constructive approach for finding bounded degree solutions to the Positivstellensatz, and are illustrated with examples from diverse application fields.

/pdf/semidefinite-programming-relaxations-for-semialgebraic-54kejoyrbk.pdf

Semidefinite programming relaxations for semialgebraic problems

This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as Web browsing, state-transition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective.

/pdf/graph-visualization-and-navigation-in-information-24tisrjfna.pdf

Graph visualization and navigation in information visualization: A survey

Algebraically Closed Fields- Real Closed Fields- Semi-Algebraic Sets- Algebra- Decomposition of Semi-Algebraic Sets- Elements of Topology- Quantitative Semi-algebraic Geometry- Complexity of Basic Algorithms- Cauchy Index and Applications- Real Roots- Cylindrical Decomposition Algorithm- Polynomial System Solving- Existential Theory of the Reals- Quantifier Elimination- Computing Roadmaps and Connected Components of Algebraic Sets- Computing Roadmaps and Connected Components of Semi-algebraic Sets

Algorithms in real algebraic geometry

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph withn vertices has a Fary embedding (i.e., straight-line embedding) on the 2n−4 byn−2 grid and provide anO(n) space,O(n logn) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any setF, which can support a Fary embedding of every planar graph of sizen, has cardinality at leastn+(1−o(1))√n which settles a problem of Mohar.

How to draw a planar graph on a grid

In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the imput polynomials) and the combinatorial part (the dependence on the number of polynomials) are sparated. Another new feature is that the degrees of the polynomials in the equivalent quantifier-free formula that is output, are independent of the number of input polynomials. As special cases of this algorithm new and improved algorithms for deciding a sentence in the first order theory over real closed fields, and also for solving the existential problem in the first order theory over real closed fields, are obtained.

On the combinatorial and algebraic complexity of quantifier elimination

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with n vertices has a Fary embedding (i.e., straight-line embedding) on the 2n - 4 by n - 2 grid and provide an O(n) space, O(n log n) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any set F, which can support a Fary embedding of every planar graph of size n, has cardinality at least n + (1 - o(1)) √n which settles a problem of Mohar.

/pdf/small-sets-supporting-fary-embeddings-of-planar-graphs-2vh09fya6r.pdf

Richard Pollack

Papers

Algorithms in real algebraic geometry

How to draw a planar graph on a grid

On the combinatorial and algebraic complexity of quantifier elimination

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Small sets supporting fary embeddings of planar graphs