Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!ima!necntc!mit-eddie!wjc
From: wjc@mit-eddie.UUCP
Newsgroups: comp.graphics
Subject: Re: Munching Squares
Message-ID: <6023@eddie.MIT.EDU>
Date: Fri, 5-Jun-87 11:01:27 EDT
Article-I.D.: eddie.6023
Posted: Fri Jun  5 11:01:27 1987
Date-Received: Sat, 6-Jun-87 09:58:45 EDT
References: <6004@eddie.MIT.EDU> <536@iscuva.ISCS.COM> <6019@eddie.MIT.EDU>
Organization: MIT EE/CS Computer Facility, Cambridge, MA
Lines: 12
Summary: Correction to previous posting...



In my description of the Munching Squares algorithm, I said that
SEED and ACC are N bits long.  They should each be 2N bits long.

To clear things up:
		If you have a bitmap that is 256 pixels by 256
	pixels, then SEED and ACC should each be 16 bits long.  X
	and Y should each be 8 bits long.

Sorry for the confusion.
Bill