comp.lang.idl-pvwave archive: archive » Polyfill: algorithm to subdivide polygons bigger than PS Path

Home » Public Forums » archive » Polyfill: algorithm to subdivide polygons bigger than PS Path_Points limit?

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Polyfill: algorithm to subdivide polygons bigger than PS Path_Points limit? [message #7709]

Thu, 02 January 1997 00:00

art.croucher
Messages: 11
Registered: March 1995

Junior Member

I'm trying to write software to do color fills of land masses, and I
keep running into problems with the Postscript Path_points limit on the
number of vertices.

Since my coastlines can have more vertices than I can expect any
Postscript printer to support (my 32MB Tektronix supports about 8K and
the biggest GSHHS coastline polygon has 1,400,000 vertices), does anyone
have an algorithm to decompose one huge irregular polygon into a number
of smaller contigous ones?

Thanks,

Art Croucher
Johns Hopkins Applied Physics Lab

PS: I know 1,400,000 vertices is overkill! But 8K isn't enough, and
most printers won't even support that.

Report message to a moderator

[Message index]

Polyfill: algorithm to subdivide polygons bigger than PS Path_Points limit?

By: art.croucher on Thu, 02 January 1997 00:00

Previous Topic:	extracting draw widget id from window id?
Next Topic:	Re: length of an ascii file

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sat Nov 29 13:35:31 PST 2025

Total time taken to generate the page: 0.80542 seconds