home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!decwrl!sgi!odin!fido!akin
- From: akin@sgi.com (Allen Akin)
- Subject: Re: Graphing ranges question (2D)...
- Message-ID: <pjle2ao@fido.asd.sgi.com>
- Sender: news@fido.asd.sgi.com (Usenet News Admin)
- Organization: Silicon Graphics, Inc.
- References: <92251.142224IFF291@DJUKFA11.BITNET>
- Date: Tue, 8 Sep 1992 17:38:12 GMT
- Lines: 10
-
- In article <92251.142224IFF291@DJUKFA11.BITNET> IFF291@DJUKFA11.BITNET (Stephan Petersen) writes:
- |
- | Is there a routine which, as universal as possible (that is without
- | considering *too* many special cases), determines for a given
- | minimum/maximum pair of values plotting ranges *that make sense* ?
-
- Check out Paul Heckbert's "Nice Numbers for Graph Labels" starting on
- page 61 of Graphics Gems.
-
- Allen
-