1.6.3 Triangulation

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set of points, or a polyhedron

Problem: Partition the interior of the point set or polyhedron into triangles.

Implementations

  • Triangle: A Two-Dimensional Quality Mesh Generator (C) (rating 9)
  • GEOMPACK - triangulation and convex decomposition codes (FORTRAN) (rating 8)
  • Fortune's 2D Voronoi diagram code (C) (rating 7)
  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 6)
  • Qhull - higher dimensional convex hull program (C) (rating 6)
  • GraphEd -- Graph Editor and Layout Program (C) (rating 4)
  • Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 4)
  • Joseph O'Rourke's Computational Geometry (C) (rating 3)

    Related Problems

  • Polygon Partitioning
  • Voronoi Diagrams

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .