The program demonstrates the computation of cuttings in the plane. It
implements several algorithms from this
paper, and serve as a proof that the algorithm presented there is
simple, and efficient.
The program is written in C++ under Linux. It uses the qt library. Here is the traditional
screen shot:
Showing a cutting by vertical trapezoids vs. cutting by polygons.
Levels
The program also able to compute levels in line arrangement. Here is a
screen shot showing how a level looks like:
The blue line is a level in the arrangement formed by the red lines.
Source
You can get the source from here. The
program was compiled under egcs
compilr using Linux. Note that the source of the program is
copyrighted (C) by Sariel Har-Peled under the GNU GPL.
