Date: Sat, 5 Jul 1997 23:39:35 -0400
From: flindahl@pa.mother.com (Frank Lindahl)
Subject: Compressed points

I have a question about compressed points.  If someone sets up a rectangle of
squares, SQ[bb:dd] and someone with an editor changes one of them to a triangle,
TR[CC] what should the result be?

1. Apply all compressed points before uncompressed points.  But if the second
item is compressed, this doesn't help.

2. Try to break up the original into multiple compressed points.  Anybody know
a simple algorithm for doing this?

3. Break up the first compressed points into individual points.  Seems to defeat
the original purpose

4. Erase the original compressed points.  Throw the responsibility back on the
user.  Let them see to it that points don't overlap.

5. Generate an error message, expressing outrage over the heavy handed
approach to the use of software.

Comments sincerly appreciated.