August 1994
Volume 12 Number 8
GRAPHICS
Minimalist Scaling
By David Weber
When every byte and microsecond
counts, your choice of algorithms is limited. Scaling a
bit-mapped image for fax transmission, with next to no space
resources, is one such challenge.
An Efficient Flood Visit Algorithm
By Anton Treuenfels
Visiting all the points in an
enclosed region is a recurring problem in graphics
processing. Here's an alogrithm that visits each point
exactly once, and is reasonably tidy about doing so in the
bargain.
FEATURE
Multithreading with OS/2 and Borland C++
By Michael Kelly
Multithreaded code and reentrancy
are becoming hot topics in "advanced" C++
programming, but both techniques often lead to simpler
programs, not more complex ones.
COLUMNS
Standard C: Extractors
P. J. Plauger
Stepping Up to C++: Designing Generic Container Classes, Part 2
Dan Saks
CUG New Releases: Sound Blaster Tools, THE Editor, and RTTI for UNIX
Victor R. Volkman