Triangulations appear in many different parts of mathematics and computer science since they are the natural way to decompose a region of space into smaller, easy-to-handle pieces. From volume computations and meshing to algebra and topology, there are many natural situations in which one has a ?xed set of points that can be used as vertices for the triangulation. Typically one wants to ?nd an optimal triangulation of those points or to explore the set of their all triangulations. The given points may represent the sites for a Delaunay triangulation computation, d thetest pointsfora surfacereconstruction,ora set ofmomials,representedaslattice pointsinZ ,inanalgebra- geometric meaning. A central theme of this book is to use the rich geometric structure of the space of triangulations of a given set of points to solve computational problems (e.g., counting the number of triangulations or ?nding optimal triangulations with respect to various criteria), and for setting up connections to vel applications in algebra, computer science, combinatorics, and optimization. Thus at the heart of the book is a comprehensive treatment of the theory of regular subdivisions, secondary polytopes, ?ips, chambers, and their interactions. Again, we ?rmly believe that understandingthe fundamentsof geometry and combinatoricspays up for algorithmsand applications.
J.A. De Loera is a professor of mathematics at the University of California, Davis. His work approaches difficult computational problems in discrete mathematics and optimization using tools from algebra and convex geometry. His research has been recognized by an Alexander von Humboldt Fellowship and several national and international grants. He is an associate editor of the journal Discrete Optimization . Jorg Rambau is the chair professor of Wirtschaftsmathematik (Business Mathematics) at the Universitat of Bayreuth since 2004. Before that he was associate head of the optimization department at the Zuse Institute Berlin (ZIB). His research encompasses problems in applied optimization, algorithmic discrete mathematics and combinatorial geometry. He is the creator of the state of the art program for triangulation computations TOPCOM. He is associate editor of the Jahresberichte der Deutschen Mathematiker-Vereinigung . Francisco Santos, a professor at the Universidad de Cantabria Spain, received the Young Researcher award from the Universidad Complutense de Madrid in 2003 and was an invited speaker in the Combinatorics Section of the International Congress of Mathematicians in 2006. He is well-known for his explicit constructions of polytopes with disconnected spaces of triangulations, some of which are featured in this book. He is an editor of Springer Verlag's journal Discrete and Computational Geometry .
Francisco Santos, Jesus A. De Loera, Jorg Rambau
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Date of Publication
Algorithms and Computation in Mathematics
Series Part/Volume Number
Place of Publication
Country of Publication
Springer-Verlag Berlin and Heidelberg GmbH & Co. K