Large Polygon reduction algorithm

[Tom Barton]

We have a customer who frequently deals with polygons that have greater than
255 vertices ( the max allowed by SGI).  He gets the data from another 
software package and uses the IRIS to display the data.  He has a method of
dealing with these polygons, but it is limited in speed and capabilities.

He would be eternally grateful for an algorithm that can break up his large
polygons into polygons with less than 255 vertices.  Additionally, his large
polygons often have holes in them, so the algorithm would have to be able to
deal with these.  Can anyone out there help this unfortunate individual? :-)
(He doesn't have email.)

Thanks for any help you may be able to provide.

--

					Tom Barton
					SGI - Dallas

				   email: sgi.com!trb
				   vmail: 8047
				   phone: 214-788-4122