Triangulations pp 377-432 | Cite as

Algorithmic Issues

  • Jesús A. De LoeraEmail author
  • Jörg Rambau
  • Francisco Santos
Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 25)


In previous chapters, we have not been directly concerned with how to actually carry on calculations required to investigate triangulations. For example, how can we efficiently verify whether a set of simplices forms a triangulation? How can we verify whether a triangulation is regular? We have already counted triangulations via formulas for a few well-structured instances, but we have not discussed how one could actually list or enumerate all triangulations of arbitrary dimensional configurations (though we did some of that in dimension two). Similarly, we have not addressed the issue of finding optimal or special triangulations explicitly. For instance, given a d-dimensional point configuration (e.g., the vertices of a d-cube), how can we find a triangulation with the smallest number of d-simplices? In this chapter, we deal with the computation and complexity of carrying through some natural computations on the space of triangulations.


Simplicial Complex Conjunctive Normal Form Steiner Point Boolean Formula Algorithmic Issue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jesús A. De Loera
    • 1
    Email author
  • Jörg Rambau
    • 2
  • Francisco Santos
    • 3
  1. 1.Department of MathematicsUniversity of California, DavisDavisUSA
  2. 2.Lehrstuhl für WirtschaftsmathematikUniversität BayreuthBayreuthGermany
  3. 3.Depto. Matemáticas Estadística y ComputaciónUniversidad de CantabriaSantanderSpain

Personalised recommendations