The complexity of finding small triangulations of convex 3-polytopes

@article{Below2004TheCO,
  title={The complexity of finding small triangulations of convex 3-polytopes},
  author={Alexander Below and Jes{\'u}s A. De Loera and J{\"u}rgen Richter-Gebert},
  journal={J. Algorithms},
  year={2004},
  volume={50},
  pages={134-167}
}
We present a polynomial transformation from the satisfiability problem to the problem of fin a triangulation of a convex 3-polytope that uses a small number of tetrahedra. We also discu complexity results related to optimal triangulations.  2003 Elsevier Inc. All rights reserved. 
5 Citations
32 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Polynomial equations and convex polytopes

  • B. Sturmfels
  • Amer. Math. Monthly 105
  • 1998
1 Excerpt

Volume formulae for regular hyperbolic cubes

  • T. H. Marshall
  • Conform. Geom. Dynam. 2
  • 1998

Lectures on Polytopes

  • G. M. Ziegler
  • Springer-Verlag, New York
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…