Abstract
A method is presented for decomposing polygons into convex sets. The method is based upon a Delaunay tessellation of the polygon. It is implemented as a divide-and-conquer technique.

This publication has 4 references indexed in Scilit: