1.6.11 Polygon Partitioning

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A polygon or polyhedron P .

Problem: How can P be partitioned into a small number of simple (typically convex) pieces?

Implementations

  • GEOMPACK - triangulation and convex decomposition codes (FORTRAN) (rating 8)

    Related Problems

  • Set Cover
  • Triangulation

    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 .