Algorithms and Complexity for Tetrahedralization Detections

  • Boting Yang
  • Cao An Wang
  • Francis Chin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2518)


Let \( \mathcal{L} \) be a set of line segments in three dimensional Euclidean space. In this paper, we prove several characterizations of tetrahe-dralizations. We present an O(nm log n) algorithm to determine whether \( \mathcal{L} \) is the edge set of a tetrahedralization, where m is the number of segments and n is the number of endpoints in \( \mathcal{L} \). We show that it is NP-complete to decide whether \( \mathcal{L} \) contains the edge set of a tetrahedralization. We also show that it is NP-complete to decide whether \( \mathcal{L} \) is tetrahedralizable.


Convex Hull Conjunctive Normal Form Convex Polyhedron Steiner Point Boolean Formula 
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.


  1. 1.
    D. Avis and H. ElGindy, Triangulating point sets in space, Discrete and Computational Geometry, 2(1987)99–111.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    C. Bajaj and T.K. Dey, Convex decomposition of polyhedra and robustness, SIAM Journal on Computing, 21(1992)339–364.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    A. Below, J.A. De Loera and J. Richter-Gebert, Finding minimal triangulations of convex 3-polytopes is NP-hard, In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 9–11, 2000.Google Scholar
  4. 4.
    M. Bern and D. Eppstein, Mesh generation and optimal triangulation, In Computing in Euclidean Geometry, (D. Du and F. Hwang eds.), World Scientific Publishing Co. 1992.Google Scholar
  5. 5.
    B. Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM Journal on Computing, 13(1984)488–507.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    B. Chazelle and L. Palios, Triangulating a nonconvex polytope, Discrete and computational geometry, 5(1990)505–526.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    O. Devillers, G. Liotta, F.P. Preparata and R. Tamassia, Checking the Convexity of Polytopes and the Planarity of Subdivisions, Computational Geometry: Theory and Applications, 11(1998)187–208.zbMATHMathSciNetGoogle Scholar
  8. 8.
    H. Edelsbrunner, F. Preparata and D. West, Tetrahedralizing point sets in three dimensions, Journal of Symbolic Computation, 10(1990)335–347.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    J. Goodman and J. Pach, Cell Decomposition of Polytopes by Bending, Israel Journal of Math, 64(1988)129–138.zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    J. Hershberger and J. Snoeyink, Convex polygons made from few lines and convex decompositions of polyhedra, In Lecture Notes in Computer Science 621, 376–387, 1992.MathSciNetGoogle Scholar
  11. 11.
    J.E. Hopcroft and R.E. Tarjan, Efficient planarity testing, Journal of ACM, 21 (1974) 549–568.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    E.L. Lloyd, On triangulations of a set of points in the plane, In Proc. 18th FOCS, 228–240, 1977.Google Scholar
  13. 13.
    K. Mehlhorn, S. Näher, M. Seel, R. Seidel, T. Schilz, S. Schirra and C. Uhrig, Checking Geometric Programs or Verification of Geometric Structures, Computational Geometry: Theory and Applications, 12(1999)85–103.zbMATHMathSciNetGoogle Scholar
  14. 14.
    J. Richter-Gebert, Finding small triangulations of polytope boundaries is hard, Discrete and Computational Geometry, 24(2000)503–517.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    J. Rupert and R. Seidel, On the difficulty of triangulating three-dimensional non-convex polyhedra, Discrete and Computational Geometry, 7(1992)227–253.CrossRefMathSciNetGoogle Scholar
  16. 16.
    E. Schönhardt, Uber die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Annalen 98(1928)309–312.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Boting Yang
    • 1
  • Cao An Wang
    • 2
  • Francis Chin
    • 3
  1. 1.Department of Computer ScienceUniversity of ReginaReginaCanada
  2. 2.Department of Computer ScienceMemorial University of NewfoundlandSt.John’sCanada
  3. 3.Department of Computer Science and Information SystemsThe University of Hong KongHong Kong

Personalised recommendations