Hi, A thought on borders The problem border was a line of form Line m 0x92492492 0x1400 0x0 in bits 1001 0010 0100 1001 0010 0100 1001 0010 9 2 4 9 2 4 9 2It is a repeating pattern of 1 (one unit of line) followed by 00 (two units of space), in 32 bits you get about ten repetitions which ends up feeding around 20 dashes to PostScript.
The point is that one could instead have a line pattern of eleven bits set to one, followed by twenty-one bits set to zero. The results should be the same because the pattern is stretched, but the pattern fed to PostScript will only have 2 dashes.
The code in OP performs various manipulations on the line patterns to reduce the dash data, obviously it is not clever enough to spot the above.
Conundrum - what is the pattern which produces the longest sequence of dashes and can't be simplified.
-- David Pilling email: david@xxxxxxxxxxxxxxxxxxx web: http://www.davidpilling.net post: David Pilling P.O. Box 22 Thornton Cleveleys Blackpool. FY5 1LR UK fax: +44(0)870-0520-941 To unsubscribe or subscribe goto: //www.freelists.org/list/davidpilling