1.6.12 Simplifying Polygons

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A polygon or polyhedron p , with n vertices.

Problem: Find a polygon or polyhedron p' with n' vertices, where the shape of p' is close to p while n' << n .

Implementations

  • Skeletonization Software (2-D) (C) (rating 5)

    Related Problems

  • Convex Hull
  • Discrete Fourier Transform
  • Minkowski Sum

    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 .