Triangulations : structures for algorithms and applications
 Responsibility
 Jesús A. De Loera, Jörg Rambau, Francisco Santos.
 Imprint
 Berlin ; New York : Springer, c2010.
 Physical description
 xiii, 535 p. : ill. (some col.) ; 27 cm.
 Series
 Algorithms and computation in mathematics ; v. 25.
Access
Available online
Science Library (Li and Ma)
Stacks
Call number  Status 

QA197 .D45 2010  Unknown 
More options
Creators/Contributors
 Author/Creator
 De Loera, Jesús A., 1966
 Contributor
 Rambau, Jörg.
 Santos, Francisco, 1968
Contents/Summary
 Bibliography
 Includes bibliographical references (p. [513]530) and index.
 Contents

 Triangulations in Mathematics. Configurations, Triangulations, Subdivisions, and Flips. Life in Two Dimensions. A Tool Box. Regular Triangulations and Secondary Polytopes. Some Interesting Configurations. Some Interesting Triangulations. Algorithmic Issues. Further Topics.
 (source: Nielsen Book Data)9783642129704 20160605
 Publisher's Summary
 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, easytohandle 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 ofmonomials, 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 novel 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.
(source: Nielsen Book Data)9783642129704 20160605  Supplemental links

Table of contents
Table of contents
Bibliographic information
 Publication date
 2010
 Series
 Algorithms and computation in mathematics, 14311550 ; v. 25
 Note
 "With 550 figures and 14 tables"T.p.
 ISBN
 9783642129704 (hbk.)
 3642129706 (hbk.)