m***@gmail.com

2016-10-07 08:45:57 UTC

http://www.cs.man.ac.uk/aig/staff/alan/software/index.html

* Difference, intersection, exclusive-or and union clip

operations are supported.

* Polygons may be comprised of multiple disjoint contours.

* Contour vertices may be given in any order - clockwise or

anticlockwise.

* Contours may be convex, concave or self-intersecting.

* Contours may be nested (i.e. polygons may have holes).

* Output may take the form of either polygon contours or

tristrips.

* Hole and external contours are differentiated in the

result.

* Coincident edges and degenerate regions are handled

correctly.

Even if you don't require a polygon clipper you may find

* Triangulating (with tristrips) an arbitrary set of

polygon contours (self-intersecting, holes etc).

* Converting self-intersecting polygon contours to a

set of non-intersecting contours.

* Seamlessly merging polygons which share common edges.

* Performing a polygon-in-polygon test.

This software is free for non-commercial use. Anyone wishing to use the gpc

Alan Murta

-------------------------------------------------------------------

Alan Murta Computer Science Department, University of Manchester,

Lecturer Manchester, M13 9PL, UK. Tel: +44 (0)161-275-6259

World Wide Web: http://www.cs.man.ac.uk/aig/staff/alan

-------------------------------------------------------------------

The version at the University has serious faults .the triangulation output is wrong at the last step if the left and right arms of the strip are of unequal length. The Code for EMX is also wrong in rare cases.* Difference, intersection, exclusive-or and union clip

operations are supported.

* Polygons may be comprised of multiple disjoint contours.

* Contour vertices may be given in any order - clockwise or

anticlockwise.

* Contours may be convex, concave or self-intersecting.

* Contours may be nested (i.e. polygons may have holes).

* Output may take the form of either polygon contours or

tristrips.

* Hole and external contours are differentiated in the

result.

* Coincident edges and degenerate regions are handled

correctly.

Even if you don't require a polygon clipper you may find

* Triangulating (with tristrips) an arbitrary set of

polygon contours (self-intersecting, holes etc).

* Converting self-intersecting polygon contours to a

set of non-intersecting contours.

* Seamlessly merging polygons which share common edges.

* Performing a polygon-in-polygon test.

This software is free for non-commercial use. Anyone wishing to use the gpc

Alan Murta

-------------------------------------------------------------------

Alan Murta Computer Science Department, University of Manchester,

Lecturer Manchester, M13 9PL, UK. Tel: +44 (0)161-275-6259

World Wide Web: http://www.cs.man.ac.uk/aig/staff/alan

-------------------------------------------------------------------