Logo - springer
Slogan - springer

Mathematics - Algebra | Triangulations - Structures for Algorithms and Applications

Triangulations

Structures for Algorithms and Applications

De Loera, Jesus, Rambau, Joerg, Santos, Francisco

2010, X, 539p. 496 illus., 281 illus. in color.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$59.95

(net) price for USA

ISBN 978-3-642-12971-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$84.95

(net) price for USA

ISBN 978-3-642-12970-4

free shipping for individuals worldwide

online orders shipping within 2-3 days.


add to marked items

  • First comprehensive treatment of the theory of regular triangulations, secondary polytopes and related topics appearing in book form
  • Discusses the geometric structure behind the algorithms and shows new emerging applications
  • Theory discusses high-dimensional situations, an area that is not always covered in computational geometry
  • Step-by-step introduction assuming very little background
  • Hundreds of illustrations, examples, and exercises
Triangulations appear everywhere, from volume computations and meshing to algebra and topology. This book studies the subdivisions and triangulations of polyhedral regions and point sets and presents the first comprehensive treatment of the theory of secondary polytopes and related topics. A central theme of the book is the use of the rich structure of the space of triangulations to solve computational problems (e.g., counting the number of triangulations or finding optimal triangulations with respect to various criteria), and to establish connections to applications in algebra, computer science, combinatorics, and optimization. With many examples and exercises, and with nearly five hundred illustrations, the book gently guides readers through the properties of the spaces of triangulations of "structured" (e.g., cubes, cyclic polytopes, lattice polytopes) and "pathological" (e.g., disconnected spaces of triangulations) situations using only elementary principles.

Content Level » Upper undergraduate

Keywords » Graph - algorithms - computational geometry - convex geometry - polyhedral subdivisions - polytopes - triangulations

Related subjects » Algebra - Computational Science & Engineering - Geometry & Topology - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algebraic Geometry.